./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-while_file-66.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 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:16:34,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:16:34,336 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:16:34,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:16:34,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:16:34,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:16:34,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:16:34,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:16:34,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:16:34,368 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:16:34,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:16:34,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:16:34,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:16:34,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:16:34,371 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:16:34,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:16:34,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:16:34,372 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:16:34,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:16:34,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:16:34,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:16:34,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:16:34,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:16:34,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:16:34,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:16:34,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:16:34,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:16:34,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:16:34,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:16:34,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:16:34,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:16:34,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:16:34,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:16:34,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:16:34,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:16:34,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:16:34,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:16:34,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:16:34,382 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:16:34,382 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:16:34,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:16:34,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:16:34,384 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 -> 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e [2024-11-09 00:16:34,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:16:34,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:16:34,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:16:34,706 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:16:34,706 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:16:34,708 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-09 00:16:36,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:16:36,500 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:16:36,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-09 00:16:36,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bafb82c/a501183196cd49b794a2d31bdc6a9bb1/FLAGdf476ad0e [2024-11-09 00:16:36,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bafb82c/a501183196cd49b794a2d31bdc6a9bb1 [2024-11-09 00:16:36,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:16:36,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:16:36,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:16:36,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:16:36,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:16:36,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:16:36" (1/1) ... [2024-11-09 00:16:36,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40072145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:36, skipping insertion in model container [2024-11-09 00:16:36,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:16:36" (1/1) ... [2024-11-09 00:16:36,924 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:16:37,157 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-while_file-66.i[915,928] [2024-11-09 00:16:37,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:16:37,265 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:16:37,279 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-while_file-66.i[915,928] [2024-11-09 00:16:37,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:16:37,350 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:16:37,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37 WrapperNode [2024-11-09 00:16:37,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:16:37,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:16:37,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:16:37,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:16:37,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,419 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-09 00:16:37,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:16:37,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:16:37,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:16:37,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:16:37,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,444 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,474 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-09 00:16:37,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:16:37,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:16:37,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:16:37,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:16:37,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (1/1) ... [2024-11-09 00:16:37,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:16:37,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:16:37,560 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-09 00:16:37,562 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-09 00:16:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:16:37,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:16:37,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:16:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:16:37,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:16:37,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:16:37,702 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:16:37,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:16:38,067 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 00:16:38,067 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:16:38,082 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:16:38,082 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:16:38,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:16:38 BoogieIcfgContainer [2024-11-09 00:16:38,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:16:38,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:16:38,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:16:38,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:16:38,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:16:36" (1/3) ... [2024-11-09 00:16:38,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c23bfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:16:38, skipping insertion in model container [2024-11-09 00:16:38,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:16:37" (2/3) ... [2024-11-09 00:16:38,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c23bfb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:16:38, skipping insertion in model container [2024-11-09 00:16:38,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:16:38" (3/3) ... [2024-11-09 00:16:38,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-09 00:16:38,116 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:16:38,117 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:16:38,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:16:38,197 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;@316bd1c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:16:38,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:16:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:16:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:16:38,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:16:38,216 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:38,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:16:38,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:16:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-09 00:16:38,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:16:38,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512580783] [2024-11-09 00:16:38,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:16:38,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:16:43,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:16:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:16:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:16:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:16:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:16:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:16:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:16:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:16:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:16:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:16:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:16:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:16:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:16:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:16:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:16:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:16:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:16:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:16:43,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:16:43,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512580783] [2024-11-09 00:16:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512580783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:16:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:16:43,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:16:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930560194] [2024-11-09 00:16:43,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:16:43,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:16:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:16:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:16:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:16:43,790 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:16:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:16:44,881 INFO L93 Difference]: Finished difference Result 236 states and 392 transitions. [2024-11-09 00:16:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:16:44,884 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:16:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:16:44,895 INFO L225 Difference]: With dead ends: 236 [2024-11-09 00:16:44,897 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 00:16:44,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:16:44,910 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 213 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:16:44,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 433 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:16:44,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 00:16:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 102. [2024-11-09 00:16:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 00:16:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-09 00:16:45,010 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-09 00:16:45,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:16:45,011 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-09 00:16:45,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:16:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-09 00:16:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:16:45,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:16:45,017 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:45,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:16:45,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:16:45,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:16:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash 40097505, now seen corresponding path program 1 times [2024-11-09 00:16:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:16:45,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516890891] [2024-11-09 00:16:45,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:16:45,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:16:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:16:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:16:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:16:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:16:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:16:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:16:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:16:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:16:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:16:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:16:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:16:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:16:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:16:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:16:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:16:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:16:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:16:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:16:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:16:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516890891] [2024-11-09 00:16:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516890891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:16:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:16:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 00:16:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850067432] [2024-11-09 00:16:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:16:50,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:16:50,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:16:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:16:50,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:16:50,648 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:16:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:16:52,673 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2024-11-09 00:16:52,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 00:16:52,674 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:16:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:16:52,676 INFO L225 Difference]: With dead ends: 178 [2024-11-09 00:16:52,676 INFO L226 Difference]: Without dead ends: 176 [2024-11-09 00:16:52,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-09 00:16:52,682 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 186 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:16:52,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 534 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 00:16:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-09 00:16:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2024-11-09 00:16:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 00:16:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-09 00:16:52,713 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-09 00:16:52,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:16:52,714 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-09 00:16:52,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:16:52,714 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-09 00:16:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:16:52,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:16:52,718 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:52,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:16:52,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:16:52,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:16:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 718308833, now seen corresponding path program 1 times [2024-11-09 00:16:52,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:16:52,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967547867] [2024-11-09 00:16:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:16:52,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:16:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:16:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:16:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:16:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:16:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:16:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:16:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:16:57,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:16:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:16:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:16:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:16:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:16:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:16:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:16:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:16:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:16:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:16:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:16:57,069 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:16:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:16:57,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967547867] [2024-11-09 00:16:57,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967547867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:16:57,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:16:57,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:16:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252481135] [2024-11-09 00:16:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:16:57,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:16:57,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:16:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:16:57,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:16:57,075 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:16:58,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:16:58,161 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2024-11-09 00:16:58,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:16:58,162 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:16:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:16:58,166 INFO L225 Difference]: With dead ends: 185 [2024-11-09 00:16:58,166 INFO L226 Difference]: Without dead ends: 183 [2024-11-09 00:16:58,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:16:58,168 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 219 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:16:58,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 432 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:16:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-09 00:16:58,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2024-11-09 00:16:58,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 00:16:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-11-09 00:16:58,201 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 119 [2024-11-09 00:16:58,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:16:58,205 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-11-09 00:16:58,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:16:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-11-09 00:16:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:16:58,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:16:58,208 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:16:58,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:16:58,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:16:58,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:16:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash 720155875, now seen corresponding path program 1 times [2024-11-09 00:16:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:16:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228426719] [2024-11-09 00:16:58,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:16:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:16:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:17:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:17:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:17:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:17:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:17:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:17:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:17:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:17:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:17:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:17:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:17:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:17:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:17:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:17:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:17:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:17:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:17:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:17:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:03,430 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:17:03,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:17:03,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228426719] [2024-11-09 00:17:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228426719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:17:03,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:17:03,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 00:17:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345916599] [2024-11-09 00:17:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:17:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:17:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:17:03,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:17:03,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:17:03,436 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:04,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:17:04,822 INFO L93 Difference]: Finished difference Result 183 states and 248 transitions. [2024-11-09 00:17:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 00:17:04,823 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:17:04,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:17:04,825 INFO L225 Difference]: With dead ends: 183 [2024-11-09 00:17:04,825 INFO L226 Difference]: Without dead ends: 181 [2024-11-09 00:17:04,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-09 00:17:04,827 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 193 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:17:04,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 513 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:17:04,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-09 00:17:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 102. [2024-11-09 00:17:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 00:17:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2024-11-09 00:17:04,854 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2024-11-09 00:17:04,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:17:04,856 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2024-11-09 00:17:04,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:04,856 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2024-11-09 00:17:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:17:04,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:04,862 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:04,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:17:04,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:04,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash 296415901, now seen corresponding path program 1 times [2024-11-09 00:17:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:17:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668552749] [2024-11-09 00:17:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:17:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:17:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:17:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:17:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:17:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:17:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:17:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:17:04,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:17:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:17:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:17:04,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:17:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:17:04,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:17:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:17:04,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:17:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:17:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:17:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:17:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:17:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668552749] [2024-11-09 00:17:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668552749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:17:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:17:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:17:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703949626] [2024-11-09 00:17:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:17:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:17:04,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:17:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:17:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:17:04,974 INFO L87 Difference]: Start difference. First operand 102 states and 152 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:05,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:17:05,024 INFO L93 Difference]: Finished difference Result 281 states and 422 transitions. [2024-11-09 00:17:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:17:05,025 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:17:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:17:05,031 INFO L225 Difference]: With dead ends: 281 [2024-11-09 00:17:05,032 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 00:17:05,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-09 00:17:05,036 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:17:05,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:17:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 00:17:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2024-11-09 00:17:05,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 133 states have internal predecessors, (174), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-09 00:17:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 262 transitions. [2024-11-09 00:17:05,080 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 262 transitions. Word has length 119 [2024-11-09 00:17:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:17:05,081 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 262 transitions. [2024-11-09 00:17:05,081 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 262 transitions. [2024-11-09 00:17:05,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:17:05,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:05,084 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:17:05,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash -512930725, now seen corresponding path program 1 times [2024-11-09 00:17:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:17:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74769159] [2024-11-09 00:17:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:05,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:17:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:17:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:17:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:17:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:17:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:17:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:17:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:17:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:17:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:17:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:17:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:17:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:17:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:17:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:17:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:17:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:17:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:17:05,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:17:05,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:17:05,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74769159] [2024-11-09 00:17:05,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74769159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:17:05,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:17:05,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:17:05,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159430035] [2024-11-09 00:17:05,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:17:05,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:17:05,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:17:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:17:05,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:17:05,284 INFO L87 Difference]: Start difference. First operand 180 states and 262 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:17:05,488 INFO L93 Difference]: Finished difference Result 530 states and 761 transitions. [2024-11-09 00:17:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:17:05,489 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:17:05,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:17:05,492 INFO L225 Difference]: With dead ends: 530 [2024-11-09 00:17:05,493 INFO L226 Difference]: Without dead ends: 353 [2024-11-09 00:17:05,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:17:05,495 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:17:05,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 263 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:17:05,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-09 00:17:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 308. [2024-11-09 00:17:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 215 states have (on average 1.2976744186046512) internal successors, (279), 218 states have internal predecessors, (279), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-09 00:17:05,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 447 transitions. [2024-11-09 00:17:05,547 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 447 transitions. Word has length 119 [2024-11-09 00:17:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:17:05,549 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 447 transitions. [2024-11-09 00:17:05,549 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 447 transitions. [2024-11-09 00:17:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:17:05,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:05,552 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:05,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:17:05,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:05,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 167127645, now seen corresponding path program 1 times [2024-11-09 00:17:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:17:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472648601] [2024-11-09 00:17:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:17:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:17:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:17:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:17:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:17:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:17:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:17:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:17:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:17:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:17:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:17:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:17:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:17:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:17:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:17:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:17:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:17:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:17:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:17:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:17:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472648601] [2024-11-09 00:17:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472648601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:17:07,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:17:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 00:17:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502523040] [2024-11-09 00:17:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:17:07,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 00:17:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:17:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 00:17:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-09 00:17:07,776 INFO L87 Difference]: Start difference. First operand 308 states and 447 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:08,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:17:08,660 INFO L93 Difference]: Finished difference Result 454 states and 614 transitions. [2024-11-09 00:17:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 00:17:08,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:17:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:17:08,664 INFO L225 Difference]: With dead ends: 454 [2024-11-09 00:17:08,665 INFO L226 Difference]: Without dead ends: 452 [2024-11-09 00:17:08,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:17:08,666 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 243 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:17:08,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 507 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:17:08,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-09 00:17:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 364. [2024-11-09 00:17:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-09 00:17:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-09 00:17:08,740 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-09 00:17:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:17:08,740 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-09 00:17:08,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-09 00:17:08,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:17:08,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:08,743 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:08,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:17:08,743 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:08,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 168974687, now seen corresponding path program 1 times [2024-11-09 00:17:08,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:17:08,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526593224] [2024-11-09 00:17:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:17:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:17:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:17:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:17:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:17:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:17:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:17:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:17:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:17:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:17:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:17:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:17:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:17:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:17:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:17:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:17:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:17:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:17:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:17:12,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:17:12,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526593224] [2024-11-09 00:17:12,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526593224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:17:12,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:17:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 00:17:12,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480844639] [2024-11-09 00:17:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:17:12,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 00:17:12,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:17:12,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 00:17:12,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:17:12,542 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:13,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:17:13,973 INFO L93 Difference]: Finished difference Result 452 states and 612 transitions. [2024-11-09 00:17:13,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:17:13,974 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-09 00:17:13,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:17:13,977 INFO L225 Difference]: With dead ends: 452 [2024-11-09 00:17:13,977 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 00:17:13,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:17:13,978 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 288 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 00:17:13,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 543 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 00:17:13,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 00:17:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 364. [2024-11-09 00:17:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 260 states have (on average 1.2769230769230768) internal successors, (332), 265 states have internal predecessors, (332), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-09 00:17:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 516 transitions. [2024-11-09 00:17:14,028 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 516 transitions. Word has length 119 [2024-11-09 00:17:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:17:14,029 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 516 transitions. [2024-11-09 00:17:14,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-09 00:17:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 516 transitions. [2024-11-09 00:17:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:17:14,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:14,031 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:14,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:17:14,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:14,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -548555551, now seen corresponding path program 1 times [2024-11-09 00:17:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:17:14,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364165361] [2024-11-09 00:17:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:17:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:17:14,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:17:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:17:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:17:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:17:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:17:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:17:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:17:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:17:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:17:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:17:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:17:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:17:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:17:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:17:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:17:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:17:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:17:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:17:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364165361] [2024-11-09 00:17:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364165361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:17:14,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:17:14,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:17:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232999411] [2024-11-09 00:17:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:17:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:17:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:17:14,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:17:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:17:14,370 INFO L87 Difference]: Start difference. First operand 364 states and 516 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:17:14,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:17:14,624 INFO L93 Difference]: Finished difference Result 689 states and 965 transitions. [2024-11-09 00:17:14,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:17:14,625 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), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2024-11-09 00:17:14,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:17:14,629 INFO L225 Difference]: With dead ends: 689 [2024-11-09 00:17:14,629 INFO L226 Difference]: Without dead ends: 371 [2024-11-09 00:17:14,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:17:14,633 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:17:14,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 166 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:17:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-09 00:17:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 362. [2024-11-09 00:17:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 252 states have (on average 1.2341269841269842) internal successors, (311), 257 states have internal predecessors, (311), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:17:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 503 transitions. [2024-11-09 00:17:14,705 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 503 transitions. Word has length 119 [2024-11-09 00:17:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:17:14,706 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 503 transitions. [2024-11-09 00:17:14,706 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), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:17:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 503 transitions. [2024-11-09 00:17:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:17:14,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:14,707 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:14,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:17:14,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:14,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:14,708 INFO L85 PathProgramCache]: Analyzing trace with hash 306968243, now seen corresponding path program 1 times [2024-11-09 00:17:14,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:17:14,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900066514] [2024-11-09 00:17:14,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:14,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:17:14,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [530567980] [2024-11-09 00:17:14,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:17:14,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:17:14,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:17:14,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:17:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:14,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 00:17:14,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:17:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 401 proven. 93 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-09 00:17:16,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:17:16,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:17:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900066514] [2024-11-09 00:17:16,974 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 00:17:16,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530567980] [2024-11-09 00:17:16,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530567980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:17:16,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:17:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-09 00:17:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995330576] [2024-11-09 00:17:16,975 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 00:17:16,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 00:17:16,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:17:16,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 00:17:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2024-11-09 00:17:16,977 INFO L87 Difference]: Start difference. First operand 362 states and 503 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-09 00:17:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:17:18,098 INFO L93 Difference]: Finished difference Result 985 states and 1261 transitions. [2024-11-09 00:17:18,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 00:17:18,099 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 120 [2024-11-09 00:17:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:17:18,106 INFO L225 Difference]: With dead ends: 985 [2024-11-09 00:17:18,106 INFO L226 Difference]: Without dead ends: 667 [2024-11-09 00:17:18,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=287, Invalid=973, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 00:17:18,109 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 50 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:17:18,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 285 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 437 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:17:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-11-09 00:17:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 553. [2024-11-09 00:17:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 386 states have (on average 1.1580310880829014) internal successors, (447), 397 states have internal predecessors, (447), 124 states have call successors, (124), 42 states have call predecessors, (124), 42 states have return successors, (124), 113 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-09 00:17:18,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 695 transitions. [2024-11-09 00:17:18,207 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 695 transitions. Word has length 120 [2024-11-09 00:17:18,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:17:18,207 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 695 transitions. [2024-11-09 00:17:18,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 16 states have internal predecessors, (54), 6 states have call successors, (18), 6 states have call predecessors, (18), 8 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-09 00:17:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 695 transitions. [2024-11-09 00:17:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 00:17:18,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:18,209 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:18,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:17:18,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 00:17:18,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 308815285, now seen corresponding path program 1 times [2024-11-09 00:17:18,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:17:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13750173] [2024-11-09 00:17:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:18,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:17:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:17:18,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1160236941] [2024-11-09 00:17:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:18,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:17:18,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:17:18,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:17:18,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:17:18,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:17:18,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:17:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:17:18,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:17:18,817 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:17:18,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:17:18,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:17:19,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 00:17:19,025 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:17:19,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:17:19,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:17:19 BoogieIcfgContainer [2024-11-09 00:17:19,131 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:17:19,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:17:19,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:17:19,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:17:19,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:16:38" (3/4) ... [2024-11-09 00:17:19,136 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:17:19,137 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:17:19,138 INFO L158 Benchmark]: Toolchain (without parser) took 42280.39ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 98.4MB in the beginning and 471.4MB in the end (delta: -373.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:17:19,138 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:17:19,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.81ms. Allocated memory is still 169.9MB. Free memory was 98.2MB in the beginning and 127.1MB in the end (delta: -28.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-09 00:17:19,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.58ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 124.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:17:19,139 INFO L158 Benchmark]: Boogie Preprocessor took 88.28ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 119.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:17:19,139 INFO L158 Benchmark]: RCFGBuilder took 573.63ms. Allocated memory is still 169.9MB. Free memory was 119.5MB in the beginning and 99.2MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 00:17:19,139 INFO L158 Benchmark]: TraceAbstraction took 41046.00ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 98.6MB in the beginning and 471.4MB in the end (delta: -372.8MB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. [2024-11-09 00:17:19,139 INFO L158 Benchmark]: Witness Printer took 5.37ms. Allocated memory is still 520.1MB. Free memory is still 471.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:17:19,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 109.1MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.81ms. Allocated memory is still 169.9MB. Free memory was 98.2MB in the beginning and 127.1MB in the end (delta: -28.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.58ms. Allocated memory is still 169.9MB. Free memory was 127.1MB in the beginning and 124.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.28ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 119.5MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 573.63ms. Allocated memory is still 169.9MB. Free memory was 119.5MB in the beginning and 99.2MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 41046.00ms. Allocated memory was 169.9MB in the beginning and 520.1MB in the end (delta: 350.2MB). Free memory was 98.6MB in the beginning and 471.4MB in the end (delta: -372.8MB). Peak memory consumption was 273.9MB. Max. memory is 16.1GB. * Witness Printer took 5.37ms. Allocated memory is still 520.1MB. Free memory is still 471.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L92] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L95] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L101] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L104] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L106] var_1_14 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L107] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L109] var_1_20 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L112] var_1_21 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L113] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L128] RET updateVariables() [L129] CALL step() [L43] signed char stepLocal_1 = var_1_6; [L44] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L45] COND FALSE !(-25 == stepLocal_1) [L50] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L53] COND TRUE var_1_8 >= stepLocal_2 [L54] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L56] COND TRUE \read(var_1_12) [L57] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L59] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=49278] [L60] COND TRUE \read(var_1_12) [L61] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L64] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L65] COND TRUE var_1_1 < stepLocal_4 [L66] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=25, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L70] COND TRUE \read(var_1_12) [L71] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L73] COND TRUE -64 > (var_1_6 + var_1_19) [L74] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L82] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=49279, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=49278, var_1_12=1, var_1_14=0, var_1_15=49151, var_1_16=-16, var_1_18=-126, var_1_19=-66, var_1_1=0, var_1_20=194, var_1_21=194, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=49278] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 40.9s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1752 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1747 mSDsluCounter, 3898 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2965 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3381 IncrementalHoareTripleChecker+Invalid, 3533 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 933 mSDtfsCounter, 3381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 598 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=10, InterpolantAutomatonStates: 133, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 650 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1181 ConstructedInterpolants, 1 QuantifiedInterpolants, 12305 SizeOfPredicates, 7 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6027/6120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:17:19,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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-while_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:17:21,586 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:17:21,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:17:21,673 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:17:21,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:17:21,715 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:17:21,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:17:21,716 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:17:21,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:17:21,718 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:17:21,718 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:17:21,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:17:21,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:17:21,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:17:21,720 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:17:21,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:17:21,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:17:21,721 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:17:21,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:17:21,723 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:17:21,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:17:21,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:17:21,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:17:21,724 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:17:21,725 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:17:21,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:17:21,725 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:17:21,725 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:17:21,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:17:21,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:17:21,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:17:21,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:17:21,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:17:21,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:17:21,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:17:21,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:17:21,728 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:17:21,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:17:21,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:17:21,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:17:21,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:17:21,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:17:21,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:17:21,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:17:21,740 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 -> 1cf6e6673b438699da9ee704d05513145f047cb3df96501a17b1bf1cde58831e [2024-11-09 00:17:22,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:17:22,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:17:22,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:17:22,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:17:22,133 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:17:22,135 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-09 00:17:23,781 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:17:24,029 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:17:24,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-09 00:17:24,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae939df1/4336e683038e4d2c9d7abcaf4ecf93dc/FLAGf54dd3119 [2024-11-09 00:17:24,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ae939df1/4336e683038e4d2c9d7abcaf4ecf93dc [2024-11-09 00:17:24,059 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:17:24,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:17:24,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:17:24,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:17:24,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:17:24,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae24d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24, skipping insertion in model container [2024-11-09 00:17:24,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:17:24,310 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-while_file-66.i[915,928] [2024-11-09 00:17:24,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:17:24,411 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:17:24,425 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-while_file-66.i[915,928] [2024-11-09 00:17:24,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:17:24,492 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:17:24,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24 WrapperNode [2024-11-09 00:17:24,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:17:24,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:17:24,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:17:24,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:17:24,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,552 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-09 00:17:24,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:17:24,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:17:24,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:17:24,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:17:24,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,597 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-09 00:17:24,601 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:17:24,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:17:24,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:17:24,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:17:24,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (1/1) ... [2024-11-09 00:17:24,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:17:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:17:24,669 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-09 00:17:24,675 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-09 00:17:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:17:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:17:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:17:24,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:17:24,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:17:24,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:17:24,823 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:17:24,826 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:17:25,234 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 00:17:25,235 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:17:25,253 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:17:25,254 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:17:25,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:17:25 BoogieIcfgContainer [2024-11-09 00:17:25,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:17:25,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:17:25,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:17:25,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:17:25,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:17:24" (1/3) ... [2024-11-09 00:17:25,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735d12ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:17:25, skipping insertion in model container [2024-11-09 00:17:25,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:17:24" (2/3) ... [2024-11-09 00:17:25,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735d12ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:17:25, skipping insertion in model container [2024-11-09 00:17:25,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:17:25" (3/3) ... [2024-11-09 00:17:25,270 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-66.i [2024-11-09 00:17:25,291 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:17:25,291 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:17:25,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:17:25,368 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;@1ff23f92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:17:25,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:17:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.425) internal successors, (57), 41 states have internal predecessors, (57), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:17:25,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 00:17:25,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:17:25,388 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:17:25,389 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:17:25,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:17:25,394 INFO L85 PathProgramCache]: Analyzing trace with hash 38250463, now seen corresponding path program 1 times [2024-11-09 00:17:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:17:25,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209624815] [2024-11-09 00:17:25,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:17:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:17:25,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:17:25,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:17:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:25,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:17:25,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:17:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 406 proven. 78 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-09 00:17:28,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:17:32,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:17:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209624815] [2024-11-09 00:17:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209624815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:17:32,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1633101257] [2024-11-09 00:17:32,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:17:32,949 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:17:32,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:17:32,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:17:32,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-09 00:17:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:17:33,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:17:33,311 INFO L278 TraceCheckSpWp]: Computing forward predicates...