./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_loopvsstraightlinecode_50-1loop_file-56.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 b789579c26a72ad54a80221787689a82fd41f4277a636c233911da81d2141e81 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:43:51,635 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:43:51,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:43:51,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:43:51,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:43:51,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:43:51,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:43:51,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:43:51,756 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:43:51,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:43:51,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:43:51,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:43:51,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:43:51,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:43:51,762 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:43:51,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:43:51,763 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:43:51,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:43:51,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:43:51,764 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:43:51,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:43:51,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:43:51,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:43:51,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:43:51,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:43:51,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:43:51,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:43:51,769 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:43:51,769 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:43:51,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:43:51,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:43:51,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:43:51,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:43:51,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:43:51,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:43:51,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:43:51,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:43:51,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:43:51,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:43:51,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:43:51,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:43:51,774 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:43:51,774 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 -> b789579c26a72ad54a80221787689a82fd41f4277a636c233911da81d2141e81 [2024-11-12 05:43:52,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:43:52,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:43:52,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:43:52,058 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:43:52,058 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:43:52,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-56.i [2024-11-12 05:43:53,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:43:53,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:43:53,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-56.i [2024-11-12 05:43:53,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef13fb15/ef247cf448c447da8584270c8292a35a/FLAGc5d327079 [2024-11-12 05:43:54,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef13fb15/ef247cf448c447da8584270c8292a35a [2024-11-12 05:43:54,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:43:54,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:43:54,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:43:54,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:43:54,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:43:54,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28507101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54, skipping insertion in model container [2024-11-12 05:43:54,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:43:54,377 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_loopvsstraightlinecode_50-1loop_file-56.i[915,928] [2024-11-12 05:43:54,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:43:54,457 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:43:54,470 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_loopvsstraightlinecode_50-1loop_file-56.i[915,928] [2024-11-12 05:43:54,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:43:54,531 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:43:54,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54 WrapperNode [2024-11-12 05:43:54,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:43:54,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:43:54,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:43:54,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:43:54,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,610 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-12 05:43:54,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:43:54,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:43:54,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:43:54,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:43:54,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,671 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-12 05:43:54,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,672 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:43:54,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:43:54,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:43:54,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:43:54,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (1/1) ... [2024-11-12 05:43:54,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:43:54,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:43:54,737 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-12 05:43:54,740 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-12 05:43:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:43:54,791 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:43:54,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:43:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:43:54,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:43:54,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:43:54,879 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:43:54,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:43:55,292 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 05:43:55,292 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:43:55,309 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:43:55,309 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:43:55,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:43:55 BoogieIcfgContainer [2024-11-12 05:43:55,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:43:55,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:43:55,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:43:55,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:43:55,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:43:54" (1/3) ... [2024-11-12 05:43:55,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5b8af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:43:55, skipping insertion in model container [2024-11-12 05:43:55,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:43:54" (2/3) ... [2024-11-12 05:43:55,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f5b8af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:43:55, skipping insertion in model container [2024-11-12 05:43:55,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:43:55" (3/3) ... [2024-11-12 05:43:55,321 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-56.i [2024-11-12 05:43:55,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:43:55,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:43:55,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:43:55,410 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;@3d050311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:43:55,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:43:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:43:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:43:55,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:43:55,427 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:43:55,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:43:55,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:43:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1862438805, now seen corresponding path program 1 times [2024-11-12 05:43:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:43:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202314482] [2024-11-12 05:43:55,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:43:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:43:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:43:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:43:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:43:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:43:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:43:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:43:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:43:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:43:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:43:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:43:55,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:43:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:43:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:43:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:43:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:43:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:43:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:43:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:43:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:43:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:43:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:43:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:43:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 05:43:55,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:43:55,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202314482] [2024-11-12 05:43:55,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202314482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:43:55,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:43:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:43:55,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360701809] [2024-11-12 05:43:55,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:43:55,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:43:55,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:43:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:43:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:43:55,980 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 05:43:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:43:56,045 INFO L93 Difference]: Finished difference Result 123 states and 207 transitions. [2024-11-12 05:43:56,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:43:56,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-12 05:43:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:43:56,055 INFO L225 Difference]: With dead ends: 123 [2024-11-12 05:43:56,055 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 05:43:56,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-12 05:43:56,068 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:43:56,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:43:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 05:43:56,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 05:43:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:43:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-12 05:43:56,148 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 139 [2024-11-12 05:43:56,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:43:56,149 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-12 05:43:56,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-12 05:43:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-12 05:43:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:43:56,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:43:56,156 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:43:56,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:43:56,156 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:43:56,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:43:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash 859703723, now seen corresponding path program 1 times [2024-11-12 05:43:56,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:43:56,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482158753] [2024-11-12 05:43:56,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:43:56,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:43:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:43:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:43:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:43:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:43:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:43:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:43:56,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:43:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:43:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:43:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:43:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:43:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:43:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:43:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:43:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:43:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:43:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:43:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:43:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:43:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:43:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:43:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:43:56,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 05:43:56,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:43:56,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482158753] [2024-11-12 05:43:56,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482158753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:43:56,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:43:56,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:43:56,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400298805] [2024-11-12 05:43:56,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:43:56,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:43:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:43:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:43:56,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:43:56,809 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:43:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:43:56,864 INFO L93 Difference]: Finished difference Result 115 states and 171 transitions. [2024-11-12 05:43:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:43:56,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-12 05:43:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:43:56,867 INFO L225 Difference]: With dead ends: 115 [2024-11-12 05:43:56,867 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 05:43:56,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:43:56,871 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:43:56,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:43:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 05:43:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 05:43:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:43:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-12 05:43:56,889 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 139 [2024-11-12 05:43:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:43:56,892 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-12 05:43:56,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:43:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-12 05:43:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:43:56,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:43:56,911 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:43:56,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:43:56,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:43:56,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:43:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 802445421, now seen corresponding path program 1 times [2024-11-12 05:43:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:43:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433934856] [2024-11-12 05:43:56,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:43:56,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:43:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:43:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:43:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:43:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:43:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:43:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:43:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:43:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:43:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:43:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:43:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:43:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:43:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:43:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:43:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:43:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:43:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:43:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:43:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:43:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:43:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:43:57,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:43:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:43:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-12 05:43:57,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:43:57,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433934856] [2024-11-12 05:43:57,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433934856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:43:57,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:43:57,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:43:57,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263635516] [2024-11-12 05:43:57,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:43:57,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:43:57,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:43:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:43:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:43:57,771 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:43:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:43:57,886 INFO L93 Difference]: Finished difference Result 159 states and 225 transitions. [2024-11-12 05:43:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:43:57,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 139 [2024-11-12 05:43:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:43:57,889 INFO L225 Difference]: With dead ends: 159 [2024-11-12 05:43:57,889 INFO L226 Difference]: Without dead ends: 103 [2024-11-12 05:43:57,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:43:57,895 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 50 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:43:57,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 324 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:43:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-12 05:43:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 87. [2024-11-12 05:43:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 05:43:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2024-11-12 05:43:57,918 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 139 [2024-11-12 05:43:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:43:57,921 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2024-11-12 05:43:57,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-12 05:43:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-11-12 05:43:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-12 05:43:57,923 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:43:57,923 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 05:43:57,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:43:57,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:43:57,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:43:57,924 INFO L85 PathProgramCache]: Analyzing trace with hash -6901205, now seen corresponding path program 1 times [2024-11-12 05:43:57,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:43:57,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106831666] [2024-11-12 05:43:57,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:43:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:43:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat