./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:21:26,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:21:26,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:21:26,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:21:26,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:21:26,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:21:26,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:21:26,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:21:26,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:21:26,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:21:26,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:21:26,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:21:26,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:21:26,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:21:26,285 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:21:26,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:21:26,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:21:26,285 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:21:26,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:21:26,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:21:26,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:21:26,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:21:26,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:21:26,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:21:26,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:21:26,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:21:26,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:21:26,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:21:26,292 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:21:26,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:21:26,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:21:26,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:21:26,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:21:26,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:21:26,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:21:26,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:21:26,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:21:26,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:21:26,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:21:26,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:21:26,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:21:26,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:21:26,297 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 [2024-11-10 04:21:26,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:21:26,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:21:26,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:21:26,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:21:26,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:21:26,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-10 04:21:28,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:21:28,342 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:21:28,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-10 04:21:28,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c73929a/26e4c143baeb48a5b09ca9ba5fe58472/FLAGd98e69b28 [2024-11-10 04:21:28,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05c73929a/26e4c143baeb48a5b09ca9ba5fe58472 [2024-11-10 04:21:28,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:21:28,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:21:28,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:21:28,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:21:28,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:21:28,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17862e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28, skipping insertion in model container [2024-11-10 04:21:28,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:21:28,595 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2024-11-10 04:21:28,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:21:28,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:21:28,731 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2024-11-10 04:21:28,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:21:28,805 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:21:28,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28 WrapperNode [2024-11-10 04:21:28,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:21:28,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:21:28,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:21:28,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:21:28,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,898 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-11-10 04:21:28,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:21:28,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:21:28,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:21:28,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:21:28,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,953 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:21:28,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,969 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:21:28,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:21:28,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:21:28,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:21:28,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (1/1) ... [2024-11-10 04:21:28,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:21:29,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:21:29,020 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:21:29,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:21:29,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:21:29,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:21:29,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:21:29,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:21:29,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:21:29,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:21:29,180 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:21:29,182 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:21:29,695 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L177: havoc property_#t~bitwise27#1;havoc property_#t~ite29#1;havoc property_#t~bitwise28#1;havoc property_#t~short30#1; [2024-11-10 04:21:29,748 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 04:21:29,748 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:21:29,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:21:29,773 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:21:29,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:21:29 BoogieIcfgContainer [2024-11-10 04:21:29,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:21:29,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:21:29,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:21:29,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:21:29,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:21:28" (1/3) ... [2024-11-10 04:21:29,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdb06b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:21:29, skipping insertion in model container [2024-11-10 04:21:29,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:21:28" (2/3) ... [2024-11-10 04:21:29,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fdb06b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:21:29, skipping insertion in model container [2024-11-10 04:21:29,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:21:29" (3/3) ... [2024-11-10 04:21:29,785 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-10 04:21:29,802 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:21:29,803 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:21:29,872 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:21:29,879 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2554db85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:21:29,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:21:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:21:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:21:29,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:21:29,907 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:21:29,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:21:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:21:29,914 INFO L85 PathProgramCache]: Analyzing trace with hash -701963098, now seen corresponding path program 1 times [2024-11-10 04:21:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:21:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861364990] [2024-11-10 04:21:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:21:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:21:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:21:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:21:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:21:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:21:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:21:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:21:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:21:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:21:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:21:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:21:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:21:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:21:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:21:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:21:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:21:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:21:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:21:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:21:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:21:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:21:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:21:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:21:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:21:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:21:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:21:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:21:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:21:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:21:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:21:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 04:21:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 04:21:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 04:21:30,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:21:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:21:30,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861364990] [2024-11-10 04:21:30,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861364990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:21:30,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:21:30,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:21:30,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846866099] [2024-11-10 04:21:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:21:30,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:21:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:21:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:21:30,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:21:30,580 INFO L87 Difference]: Start difference. First operand has 108 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 74 states have internal predecessors, (98), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:21:30,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:21:30,632 INFO L93 Difference]: Finished difference Result 208 states and 349 transitions. [2024-11-10 04:21:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:21:30,636 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 210 [2024-11-10 04:21:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:21:30,644 INFO L225 Difference]: With dead ends: 208 [2024-11-10 04:21:30,644 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 04:21:30,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:21:30,651 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:21:30,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:21:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 04:21:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 04:21:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 04:21:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-11-10 04:21:30,709 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 210 [2024-11-10 04:21:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:21:30,710 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-11-10 04:21:30,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:21:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-11-10 04:21:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 04:21:30,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:21:30,715 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:21:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:21:30,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:21:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:21:30,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1409689882, now seen corresponding path program 1 times [2024-11-10 04:21:30,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:21:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629765106] [2024-11-10 04:21:30,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:21:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:21:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:21:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:21:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:21:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:21:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:21:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:21:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:21:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:21:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:21:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:21:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:21:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:21:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:21:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:21:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:21:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:21:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:21:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:21:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:21:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:21:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:21:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:21:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:21:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:21:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:21:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:21:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:21:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:21:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:21:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 04:21:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 04:21:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 04:21:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:21:31,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:21:31,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629765106] [2024-11-10 04:21:31,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629765106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:21:31,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:21:31,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:21:31,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510652995] [2024-11-10 04:21:31,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:21:31,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:21:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:21:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:21:31,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:21:31,542 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:21:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:21:31,813 INFO L93 Difference]: Finished difference Result 305 states and 458 transitions. [2024-11-10 04:21:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:21:31,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-11-10 04:21:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:21:31,818 INFO L225 Difference]: With dead ends: 305 [2024-11-10 04:21:31,818 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 04:21:31,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:21:31,821 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 100 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 04:21:31,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 427 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 04:21:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 04:21:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 169. [2024-11-10 04:21:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 04:21:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 255 transitions. [2024-11-10 04:21:31,865 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 255 transitions. Word has length 210 [2024-11-10 04:21:31,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:21:31,866 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 255 transitions. [2024-11-10 04:21:31,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:21:31,867 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 255 transitions. [2024-11-10 04:21:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:21:31,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:21:31,871 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:21:31,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:21:31,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:21:31,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:21:31,872 INFO L85 PathProgramCache]: Analyzing trace with hash 750702703, now seen corresponding path program 1 times [2024-11-10 04:21:31,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:21:31,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330319924] [2024-11-10 04:21:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:21:31,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:21:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:21:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:21:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:21:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:21:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:21:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:21:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:21:48,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:21:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:21:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:21:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:21:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:21:48,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:21:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:21:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:21:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:21:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:21:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:21:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:21:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:21:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:21:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:21:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:21:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:21:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:21:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:21:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:21:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:21:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:21:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 04:21:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 04:21:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 04:21:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:21:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:21:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:21:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330319924] [2024-11-10 04:21:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330319924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:21:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:21:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 04:21:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074476618] [2024-11-10 04:21:49,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:21:49,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 04:21:49,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:21:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 04:21:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-10 04:21:49,069 INFO L87 Difference]: Start difference. First operand 169 states and 255 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:21:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:21:50,827 INFO L93 Difference]: Finished difference Result 477 states and 699 transitions. [2024-11-10 04:21:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 04:21:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 211 [2024-11-10 04:21:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:21:50,836 INFO L225 Difference]: With dead ends: 477 [2024-11-10 04:21:50,836 INFO L226 Difference]: Without dead ends: 377 [2024-11-10 04:21:50,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-10 04:21:50,842 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 542 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:21:50,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 1014 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 04:21:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-10 04:21:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 278. [2024-11-10 04:21:50,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 177 states have (on average 1.2598870056497176) internal successors, (223), 178 states have internal predecessors, (223), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 04:21:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 415 transitions. [2024-11-10 04:21:50,904 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 415 transitions. Word has length 211 [2024-11-10 04:21:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:21:50,906 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 415 transitions. [2024-11-10 04:21:50,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 04:21:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 415 transitions. [2024-11-10 04:21:50,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:21:50,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:21:50,914 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:21:50,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:21:50,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:21:50,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:21:50,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1907498895, now seen corresponding path program 1 times [2024-11-10 04:21:50,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:21:50,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400956463] [2024-11-10 04:21:50,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:21:50,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:21:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:22:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:22:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:22:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:22:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:22:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:22:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:22:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:22:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:22:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:22:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:22:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:22:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:22:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:22:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:22:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:22:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:22:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:22:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:22:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:22:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:22:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:22:31,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:22:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:22:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:22:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:22:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:22:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:22:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:22:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 04:22:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 04:22:31,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 04:22:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:22:31,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:22:31,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400956463] [2024-11-10 04:22:31,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400956463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:22:31,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:22:31,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 04:22:31,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038429262] [2024-11-10 04:22:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:22:31,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 04:22:31,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:22:31,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 04:22:31,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-10 04:22:31,703 INFO L87 Difference]: Start difference. First operand 278 states and 415 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:22:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:22:32,699 INFO L93 Difference]: Finished difference Result 571 states and 836 transitions. [2024-11-10 04:22:32,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 04:22:32,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-10 04:22:32,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:22:32,708 INFO L225 Difference]: With dead ends: 571 [2024-11-10 04:22:32,708 INFO L226 Difference]: Without dead ends: 354 [2024-11-10 04:22:32,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-11-10 04:22:32,712 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 249 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 04:22:32,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 818 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 04:22:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-10 04:22:32,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 280. [2024-11-10 04:22:32,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 179 states have (on average 1.2569832402234637) internal successors, (225), 180 states have internal predecessors, (225), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 04:22:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 417 transitions. [2024-11-10 04:22:32,765 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 417 transitions. Word has length 211 [2024-11-10 04:22:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:22:32,766 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 417 transitions. [2024-11-10 04:22:32,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:22:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 417 transitions. [2024-11-10 04:22:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:22:32,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:22:32,772 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:22:32,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:22:32,772 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:22:32,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:22:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -93769168, now seen corresponding path program 1 times [2024-11-10 04:22:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:22:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060595389] [2024-11-10 04:22:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:22:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:22:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:22:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:22:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:22:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:22:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:22:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:22:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 04:22:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:22:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:22:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:22:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:22:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:22:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:22:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:22:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:22:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:22:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:22:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:22:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:22:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:22:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:22:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:22:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:22:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:22:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 04:22:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:22:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 04:22:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 04:22:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 04:22:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-10 04:22:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-10 04:22:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 04:22:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:22:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 04:22:44,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:22:44,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060595389] [2024-11-10 04:22:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060595389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:22:44,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:22:44,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 04:22:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061413473] [2024-11-10 04:22:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:22:44,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 04:22:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:22:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 04:22:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:22:44,888 INFO L87 Difference]: Start difference. First operand 280 states and 417 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:22:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:22:45,663 INFO L93 Difference]: Finished difference Result 535 states and 790 transitions. [2024-11-10 04:22:45,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 04:22:45,664 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-10 04:22:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:22:45,668 INFO L225 Difference]: With dead ends: 535 [2024-11-10 04:22:45,668 INFO L226 Difference]: Without dead ends: 435 [2024-11-10 04:22:45,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2024-11-10 04:22:45,670 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 312 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:22:45,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 723 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:22:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-10 04:22:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 381. [2024-11-10 04:22:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 246 states have (on average 1.2601626016260163) internal successors, (310), 247 states have internal predecessors, (310), 128 states have call successors, (128), 6 states have call predecessors, (128), 6 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-10 04:22:45,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 566 transitions. [2024-11-10 04:22:45,707 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 566 transitions. Word has length 211 [2024-11-10 04:22:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:22:45,708 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 566 transitions. [2024-11-10 04:22:45,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 04:22:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 566 transitions. [2024-11-10 04:22:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 04:22:45,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:22:45,711 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:22:45,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 04:22:45,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:22:45,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:22:45,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1063027024, now seen corresponding path program 1 times [2024-11-10 04:22:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:22:45,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773526922] [2024-11-10 04:22:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:22:45,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:22:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat