/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 12:22:40,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 12:22:40,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 12:22:40,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 12:22:40,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 12:22:40,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 12:22:40,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 12:22:40,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 12:22:40,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 12:22:40,532 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 12:22:40,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 12:22:40,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 12:22:40,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 12:22:40,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 12:22:40,534 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 12:22:40,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 12:22:40,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 12:22:40,535 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 12:22:40,535 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 12:22:40,536 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 12:22:40,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 12:22:40,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 12:22:40,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 12:22:40,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 12:22:40,538 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 12:22:40,538 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 12:22:40,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 12:22:40,538 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 12:22:40,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 12:22:40,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 12:22:40,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 12:22:40,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 12:22:40,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 12:22:40,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 12:22:40,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 12:22:40,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 12:22:40,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 12:22:40,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 12:22:40,541 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 12:22:40,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 12:22:40,541 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 12:22:40,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 12:22:40,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 12:22:40,542 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: Use bitabs translation -> true [2023-12-19 12:22:40,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 12:22:40,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 12:22:40,817 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 12:22:40,818 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 12:22:40,818 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 12:22:40,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-97.i [2023-12-19 12:22:42,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 12:22:42,256 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 12:22:42,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-97.i [2023-12-19 12:22:42,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911f61725/6317ca5af2b84d56baf362f159ac76c0/FLAGe9d9e937b [2023-12-19 12:22:42,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/911f61725/6317ca5af2b84d56baf362f159ac76c0 [2023-12-19 12:22:42,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 12:22:42,279 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 12:22:42,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 12:22:42,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 12:22:42,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 12:22:42,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,289 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dba1e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42, skipping insertion in model container [2023-12-19 12:22:42,289 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,324 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 12:22:42,469 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-97.i[915,928] [2023-12-19 12:22:42,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 12:22:42,565 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 12:22:42,579 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-97.i[915,928] [2023-12-19 12:22:42,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 12:22:42,633 INFO L206 MainTranslator]: Completed translation [2023-12-19 12:22:42,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42 WrapperNode [2023-12-19 12:22:42,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 12:22:42,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 12:22:42,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 12:22:42,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 12:22:42,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,702 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2023-12-19 12:22:42,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 12:22:42,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 12:22:42,703 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 12:22:42,703 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 12:22:42,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,747 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]. [2023-12-19 12:22:42,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 12:22:42,791 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 12:22:42,791 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 12:22:42,791 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 12:22:42,792 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (1/1) ... [2023-12-19 12:22:42,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 12:22:42,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 12:22:42,823 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) [2023-12-19 12:22:42,825 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 [2023-12-19 12:22:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 12:22:42,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 12:22:42,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 12:22:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 12:22:42,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 12:22:42,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 12:22:42,909 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 12:22:42,911 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 12:22:43,289 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 12:22:43,329 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 12:22:43,330 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 12:22:43,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:22:43 BoogieIcfgContainer [2023-12-19 12:22:43,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 12:22:43,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 12:22:43,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 12:22:43,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 12:22:43,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 12:22:42" (1/3) ... [2023-12-19 12:22:43,335 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd77676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:22:43, skipping insertion in model container [2023-12-19 12:22:43,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 12:22:42" (2/3) ... [2023-12-19 12:22:43,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd77676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 12:22:43, skipping insertion in model container [2023-12-19 12:22:43,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 12:22:43" (3/3) ... [2023-12-19 12:22:43,345 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-97.i [2023-12-19 12:22:43,361 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 12:22:43,361 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 12:22:43,403 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 12:22:43,408 INFO L357 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, mHoare=true, 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;@155b8e31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 12:22:43,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 12:22:43,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:22:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 12:22:43,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:43,433 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:43,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:43,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:43,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1106822011, now seen corresponding path program 1 times [2023-12-19 12:22:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:43,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375526809] [2023-12-19 12:22:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:43,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:43,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:43,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:43,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375526809] [2023-12-19 12:22:43,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375526809] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:43,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:43,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 12:22:43,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621147327] [2023-12-19 12:22:43,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:43,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 12:22:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 12:22:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 12:22:43,836 INFO L87 Difference]: Start difference. First operand has 72 states, 53 states have (on average 1.528301886792453) internal successors, (81), 54 states have internal predecessors, (81), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 12:22:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:43,867 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2023-12-19 12:22:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 12:22:43,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2023-12-19 12:22:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:43,875 INFO L225 Difference]: With dead ends: 141 [2023-12-19 12:22:43,875 INFO L226 Difference]: Without dead ends: 70 [2023-12-19 12:22:43,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 12:22:43,881 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:43,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:22:43,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-19 12:22:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-19 12:22:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:22:43,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2023-12-19 12:22:43,984 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 107 [2023-12-19 12:22:43,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:43,985 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2023-12-19 12:22:43,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 12:22:43,985 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2023-12-19 12:22:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 12:22:43,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:43,988 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:43,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 12:22:43,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:43,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash -695930423, now seen corresponding path program 1 times [2023-12-19 12:22:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:43,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273955784] [2023-12-19 12:22:43,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:43,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:44,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:44,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:44,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,211 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:44,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:44,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273955784] [2023-12-19 12:22:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273955784] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:44,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 12:22:44,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53778816] [2023-12-19 12:22:44,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:44,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 12:22:44,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:44,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 12:22:44,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:22:44,216 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:44,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:44,317 INFO L93 Difference]: Finished difference Result 197 states and 302 transitions. [2023-12-19 12:22:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 12:22:44,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 12:22:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:44,324 INFO L225 Difference]: With dead ends: 197 [2023-12-19 12:22:44,324 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 12:22:44,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:22:44,329 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 95 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:44,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 248 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 12:22:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 12:22:44,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2023-12-19 12:22:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 72 states have internal predecessors, (104), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 12:22:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2023-12-19 12:22:44,352 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 107 [2023-12-19 12:22:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:44,354 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2023-12-19 12:22:44,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2023-12-19 12:22:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 12:22:44,362 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:44,362 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:44,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 12:22:44,362 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:44,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:44,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1707047673, now seen corresponding path program 1 times [2023-12-19 12:22:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:44,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823170468] [2023-12-19 12:22:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:44,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:44,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:44,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823170468] [2023-12-19 12:22:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823170468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:44,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:44,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:22:44,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011180606] [2023-12-19 12:22:44,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:44,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:22:44,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:44,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:22:44,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:22:44,864 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:45,121 INFO L93 Difference]: Finished difference Result 296 states and 448 transitions. [2023-12-19 12:22:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 12:22:45,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 12:22:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:45,124 INFO L225 Difference]: With dead ends: 296 [2023-12-19 12:22:45,124 INFO L226 Difference]: Without dead ends: 207 [2023-12-19 12:22:45,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-19 12:22:45,126 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 131 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:45,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 328 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 12:22:45,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-19 12:22:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 173. [2023-12-19 12:22:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 138 states have (on average 1.4202898550724639) internal successors, (196), 138 states have internal predecessors, (196), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 12:22:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2023-12-19 12:22:45,155 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 107 [2023-12-19 12:22:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:45,157 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2023-12-19 12:22:45,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2023-12-19 12:22:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 12:22:45,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:45,161 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:45,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 12:22:45,162 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:45,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:45,162 INFO L85 PathProgramCache]: Analyzing trace with hash 225979926, now seen corresponding path program 1 times [2023-12-19 12:22:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:45,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690883218] [2023-12-19 12:22:45,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:45,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:45,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:45,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690883218] [2023-12-19 12:22:45,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690883218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:45,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:45,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 12:22:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326708882] [2023-12-19 12:22:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:45,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 12:22:45,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:45,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 12:22:45,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 12:22:45,626 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:45,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:45,966 INFO L93 Difference]: Finished difference Result 460 states and 684 transitions. [2023-12-19 12:22:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 12:22:45,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-19 12:22:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:45,969 INFO L225 Difference]: With dead ends: 460 [2023-12-19 12:22:45,969 INFO L226 Difference]: Without dead ends: 288 [2023-12-19 12:22:45,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-19 12:22:45,981 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 117 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:45,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 447 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 12:22:45,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-12-19 12:22:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 266. [2023-12-19 12:22:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 214 states have (on average 1.3598130841121496) internal successors, (291), 214 states have internal predecessors, (291), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 12:22:46,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 387 transitions. [2023-12-19 12:22:46,018 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 387 transitions. Word has length 108 [2023-12-19 12:22:46,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:46,018 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 387 transitions. [2023-12-19 12:22:46,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:46,019 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 387 transitions. [2023-12-19 12:22:46,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 12:22:46,021 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:46,021 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:46,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 12:22:46,021 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:46,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:46,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1162960113, now seen corresponding path program 1 times [2023-12-19 12:22:46,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:46,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212186770] [2023-12-19 12:22:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212186770] [2023-12-19 12:22:46,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212186770] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:46,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:46,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 12:22:46,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786354732] [2023-12-19 12:22:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:46,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 12:22:46,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:46,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 12:22:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:22:46,210 INFO L87 Difference]: Start difference. First operand 266 states and 387 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:46,237 INFO L93 Difference]: Finished difference Result 532 states and 775 transitions. [2023-12-19 12:22:46,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 12:22:46,238 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-19 12:22:46,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:46,240 INFO L225 Difference]: With dead ends: 532 [2023-12-19 12:22:46,240 INFO L226 Difference]: Without dead ends: 267 [2023-12-19 12:22:46,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 12:22:46,242 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:46,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:22:46,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-12-19 12:22:46,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2023-12-19 12:22:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 215 states have (on average 1.3488372093023255) internal successors, (290), 215 states have internal predecessors, (290), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 12:22:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 386 transitions. [2023-12-19 12:22:46,272 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 386 transitions. Word has length 109 [2023-12-19 12:22:46,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:46,273 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 386 transitions. [2023-12-19 12:22:46,273 INFO L496 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:46,273 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 386 transitions. [2023-12-19 12:22:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 12:22:46,274 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:46,275 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:46,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 12:22:46,277 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:46,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:46,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1421125551, now seen corresponding path program 1 times [2023-12-19 12:22:46,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:46,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840263990] [2023-12-19 12:22:46,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:46,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:46,473 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:46,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:46,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840263990] [2023-12-19 12:22:46,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840263990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:46,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:46,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:22:46,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116396499] [2023-12-19 12:22:46,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:46,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:22:46,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:46,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:22:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:22:46,476 INFO L87 Difference]: Start difference. First operand 267 states and 386 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:46,755 INFO L93 Difference]: Finished difference Result 459 states and 672 transitions. [2023-12-19 12:22:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 12:22:46,755 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-19 12:22:46,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:46,759 INFO L225 Difference]: With dead ends: 459 [2023-12-19 12:22:46,760 INFO L226 Difference]: Without dead ends: 369 [2023-12-19 12:22:46,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 12:22:46,762 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 199 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:46,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 522 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 12:22:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-19 12:22:46,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 273. [2023-12-19 12:22:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.3529411764705883) internal successors, (299), 221 states have internal predecessors, (299), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 12:22:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 395 transitions. [2023-12-19 12:22:46,814 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 395 transitions. Word has length 109 [2023-12-19 12:22:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:46,814 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 395 transitions. [2023-12-19 12:22:46,815 INFO L496 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 395 transitions. [2023-12-19 12:22:46,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 12:22:46,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:46,816 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:46,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 12:22:46,816 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:46,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:46,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1919352067, now seen corresponding path program 1 times [2023-12-19 12:22:46,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:46,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65353420] [2023-12-19 12:22:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:46,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:47,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:47,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65353420] [2023-12-19 12:22:47,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65353420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:47,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:47,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 12:22:47,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882010978] [2023-12-19 12:22:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:47,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 12:22:47,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:47,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 12:22:47,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 12:22:47,069 INFO L87 Difference]: Start difference. First operand 273 states and 395 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:47,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:47,141 INFO L93 Difference]: Finished difference Result 577 states and 837 transitions. [2023-12-19 12:22:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 12:22:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-19 12:22:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:47,143 INFO L225 Difference]: With dead ends: 577 [2023-12-19 12:22:47,143 INFO L226 Difference]: Without dead ends: 305 [2023-12-19 12:22:47,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:22:47,145 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 95 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:47,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 345 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 12:22:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-19 12:22:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 273. [2023-12-19 12:22:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 221 states have (on average 1.3167420814479638) internal successors, (291), 221 states have internal predecessors, (291), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 12:22:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 387 transitions. [2023-12-19 12:22:47,188 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 387 transitions. Word has length 109 [2023-12-19 12:22:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:47,191 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 387 transitions. [2023-12-19 12:22:47,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 387 transitions. [2023-12-19 12:22:47,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 12:22:47,192 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:47,192 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:47,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 12:22:47,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:47,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash 504397503, now seen corresponding path program 1 times [2023-12-19 12:22:47,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:47,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695972179] [2023-12-19 12:22:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:22:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:22:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:22:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:22:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:22:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:22:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:22:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:22:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:22:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:22:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:22:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:22:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:22:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:22:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:22:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:22:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:22:47,404 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:22:47,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:22:47,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695972179] [2023-12-19 12:22:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695972179] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:22:47,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:22:47,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 12:22:47,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013101528] [2023-12-19 12:22:47,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:22:47,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 12:22:47,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:22:47,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 12:22:47,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 12:22:47,406 INFO L87 Difference]: Start difference. First operand 273 states and 387 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:22:47,838 INFO L93 Difference]: Finished difference Result 744 states and 1053 transitions. [2023-12-19 12:22:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 12:22:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-12-19 12:22:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:22:47,842 INFO L225 Difference]: With dead ends: 744 [2023-12-19 12:22:47,842 INFO L226 Difference]: Without dead ends: 648 [2023-12-19 12:22:47,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 12:22:47,843 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 238 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 12:22:47,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 444 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 12:22:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-12-19 12:22:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 469. [2023-12-19 12:22:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 383 states have (on average 1.318537859007833) internal successors, (505), 383 states have internal predecessors, (505), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-19 12:22:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 665 transitions. [2023-12-19 12:22:47,953 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 665 transitions. Word has length 113 [2023-12-19 12:22:47,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:22:47,954 INFO L495 AbstractCegarLoop]: Abstraction has 469 states and 665 transitions. [2023-12-19 12:22:47,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:22:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 665 transitions. [2023-12-19 12:22:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 12:22:47,955 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:22:47,955 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:22:47,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 12:22:47,956 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:22:47,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:22:47,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1761442810, now seen corresponding path program 1 times [2023-12-19 12:22:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:22:47,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533391971] [2023-12-19 12:22:47,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:22:47,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:22:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:25,971 WARN L293 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 156 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 12:23:27,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 12:23:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 12:23:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 12:23:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 12:23:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 12:23:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 12:23:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 12:23:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 12:23:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 12:23:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:27,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 12:23:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:28,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 12:23:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:28,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 12:23:28,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:28,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 12:23:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:28,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 12:23:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:28,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 12:23:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:28,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-19 12:23:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 12:23:28,009 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 12:23:28,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 12:23:28,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533391971] [2023-12-19 12:23:28,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533391971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 12:23:28,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 12:23:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 12:23:28,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808688061] [2023-12-19 12:23:28,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 12:23:28,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 12:23:28,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 12:23:28,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 12:23:28,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-19 12:23:28,011 INFO L87 Difference]: Start difference. First operand 469 states and 665 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:23:36,947 WARN L293 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 158 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 12:23:40,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 12:23:49,386 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 165 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-19 12:23:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 12:23:55,542 INFO L93 Difference]: Finished difference Result 1071 states and 1487 transitions. [2023-12-19 12:23:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 12:23:55,543 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2023-12-19 12:23:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 12:23:55,547 INFO L225 Difference]: With dead ends: 1071 [2023-12-19 12:23:55,547 INFO L226 Difference]: Without dead ends: 892 [2023-12-19 12:23:55,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 36.1s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2023-12-19 12:23:55,549 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 298 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-12-19 12:23:55,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 339 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-12-19 12:23:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2023-12-19 12:23:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 813. [2023-12-19 12:23:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 712 states have (on average 1.3258426966292134) internal successors, (944), 717 states have internal predecessors, (944), 90 states have call successors, (90), 10 states have call predecessors, (90), 10 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-19 12:23:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1124 transitions. [2023-12-19 12:23:55,659 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1124 transitions. Word has length 113 [2023-12-19 12:23:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 12:23:55,659 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1124 transitions. [2023-12-19 12:23:55,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 12:23:55,660 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1124 transitions. [2023-12-19 12:23:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 12:23:55,661 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 12:23:55,661 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:23:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 12:23:55,664 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 12:23:55,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 12:23:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1542588092, now seen corresponding path program 1 times [2023-12-19 12:23:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 12:23:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661628491] [2023-12-19 12:23:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 12:23:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 12:23:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 12:23:55,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 12:23:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 12:23:55,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 12:23:55,838 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 12:23:55,839 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 12:23:55,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 12:23:55,843 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 12:23:55,845 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 12:23:55,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 12:23:55 BoogieIcfgContainer [2023-12-19 12:23:55,934 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 12:23:55,934 INFO L158 Benchmark]: Toolchain (without parser) took 73655.73ms. Allocated memory was 195.0MB in the beginning and 288.4MB in the end (delta: 93.3MB). Free memory was 166.6MB in the beginning and 243.2MB in the end (delta: -76.5MB). Peak memory consumption was 169.4MB. Max. memory is 8.0GB. [2023-12-19 12:23:55,935 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 195.0MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 12:23:55,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.11ms. Allocated memory is still 195.0MB. Free memory was 166.6MB in the beginning and 152.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 12:23:55,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.82ms. Allocated memory is still 195.0MB. Free memory was 152.4MB in the beginning and 148.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 12:23:55,935 INFO L158 Benchmark]: Boogie Preprocessor took 68.85ms. Allocated memory is still 195.0MB. Free memory was 148.3MB in the beginning and 142.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-19 12:23:55,935 INFO L158 Benchmark]: RCFGBuilder took 539.52ms. Allocated memory is still 195.0MB. Free memory was 142.0MB in the beginning and 116.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-19 12:23:55,936 INFO L158 Benchmark]: TraceAbstraction took 72602.04ms. Allocated memory was 195.0MB in the beginning and 288.4MB in the end (delta: 93.3MB). Free memory was 115.8MB in the beginning and 243.2MB in the end (delta: -127.3MB). Peak memory consumption was 119.0MB. Max. memory is 8.0GB. [2023-12-19 12:23:55,938 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.62ms. Allocated memory is still 195.0MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 355.11ms. Allocated memory is still 195.0MB. Free memory was 166.6MB in the beginning and 152.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.82ms. Allocated memory is still 195.0MB. Free memory was 152.4MB in the beginning and 148.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.85ms. Allocated memory is still 195.0MB. Free memory was 148.3MB in the beginning and 142.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 539.52ms. Allocated memory is still 195.0MB. Free memory was 142.0MB in the beginning and 116.4MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 72602.04ms. Allocated memory was 195.0MB in the beginning and 288.4MB in the end (delta: 93.3MB). Free memory was 115.8MB in the beginning and 243.2MB in the end (delta: -127.3MB). Peak memory consumption was 119.0MB. Max. memory is 8.0GB. * 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 someBinaryFLOATComparisonOperation at line 122. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; [L126] isInitial = 1 [L127] FCALL initially() [L128] COND TRUE 1 [L129] CALL updateLastVariables() [L119] last_1_var_1_5 = var_1_5 [L129] RET updateLastVariables() [L130] CALL updateVariables() [L92] var_1_9 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_10 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] var_1_11 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] var_1_12 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] var_1_18 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] var_1_19 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L112] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L113] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L114] var_1_23 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L115] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L130] RET updateVariables() [L131] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L62] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L63] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) [L71] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L76] signed long int stepLocal_4 = 256; [L77] unsigned char stepLocal_3 = var_1_22; [L78] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L79] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L82] COND FALSE !(stepLocal_3 || var_1_22) [L87] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L131] RET step() [L132] CALL, EXPR property() [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L122-L123] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L132] RET, EXPR property() [L132] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=0, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.5s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1173 mSDsluCounter, 2980 SdHoareTripleChecker+Invalid, 7.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1752 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1097 IncrementalHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 1228 mSDtfsCounter, 1097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 36.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=813occurred in iteration=9, InterpolantAutomatonStates: 49, 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, 9 MinimizatonAttempts, 480 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 41.9s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 973 ConstructedInterpolants, 0 QuantifiedInterpolants, 13712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 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 [2023-12-19 12:23:55,981 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...