./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:23:12,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:23:12,113 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:23:12,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:23:12,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:23:12,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:23:12,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:23:12,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:23:12,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:23:12,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:23:12,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:23:12,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:23:12,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:23:12,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:23:12,151 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:23:12,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:23:12,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:23:12,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:23:12,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:23:12,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:23:12,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:23:12,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:23:12,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:23:12,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:23:12,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:23:12,154 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:23:12,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:23:12,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:23:12,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:23:12,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:23:12,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:23:12,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:23:12,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:23:12,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:23:12,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:23:12,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:23:12,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:23:12,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:23:12,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:23:12,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:23:12,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:23:12,159 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:23:12,159 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 [2024-11-20 06:23:12,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:23:12,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:23:12,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:23:12,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:23:12,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:23:12,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2024-11-20 06:23:13,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:23:14,146 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:23:14,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2024-11-20 06:23:14,166 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f66f1a8/0adb18a0667b420e9946a9088b1c5590/FLAG56183df89 [2024-11-20 06:23:14,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38f66f1a8/0adb18a0667b420e9946a9088b1c5590 [2024-11-20 06:23:14,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:23:14,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:23:14,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:23:14,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:23:14,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:23:14,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71b9da23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14, skipping insertion in model container [2024-11-20 06:23:14,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:23:14,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i[916,929] [2024-11-20 06:23:14,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:23:14,521 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:23:14,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i[916,929] [2024-11-20 06:23:14,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:23:14,601 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:23:14,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14 WrapperNode [2024-11-20 06:23:14,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:23:14,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:23:14,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:23:14,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:23:14,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,670 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2024-11-20 06:23:14,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:23:14,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:23:14,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:23:14,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:23:14,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:23:14,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:23:14,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:23:14,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:23:14,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:23:14,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (1/1) ... [2024-11-20 06:23:14,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:23:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:23:14,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:23:14,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:23:14,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:23:14,851 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:23:14,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:23:14,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:23:14,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:23:14,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:23:14,959 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:23:14,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:23:15,595 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-20 06:23:15,595 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:23:15,638 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:23:15,638 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:23:15,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:15 BoogieIcfgContainer [2024-11-20 06:23:15,639 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:23:15,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:23:15,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:23:15,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:23:15,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:23:14" (1/3) ... [2024-11-20 06:23:15,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f6b232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:15, skipping insertion in model container [2024-11-20 06:23:15,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:14" (2/3) ... [2024-11-20 06:23:15,648 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f6b232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:15, skipping insertion in model container [2024-11-20 06:23:15,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:15" (3/3) ... [2024-11-20 06:23:15,649 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-36.i [2024-11-20 06:23:15,682 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:23:15,683 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:23:15,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:23:15,754 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@599296a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:23:15,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:23:15,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 110 states have (on average 1.490909090909091) internal successors, (164), 111 states have internal predecessors, (164), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:23:15,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 06:23:15,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:15,780 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:15,781 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:15,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 72465833, now seen corresponding path program 1 times [2024-11-20 06:23:15,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891839095] [2024-11-20 06:23:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:15,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:16,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:16,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:16,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891839095] [2024-11-20 06:23:16,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891839095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:16,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:16,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:23:16,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949362734] [2024-11-20 06:23:16,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:16,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:23:16,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:16,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:23:16,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:23:16,421 INFO L87 Difference]: Start difference. First operand has 141 states, 110 states have (on average 1.490909090909091) internal successors, (164), 111 states have internal predecessors, (164), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:23:16,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:16,466 INFO L93 Difference]: Finished difference Result 275 states and 462 transitions. [2024-11-20 06:23:16,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:23:16,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 195 [2024-11-20 06:23:16,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:16,481 INFO L225 Difference]: With dead ends: 275 [2024-11-20 06:23:16,482 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 06:23:16,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:23:16,492 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:16,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:23:16,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 06:23:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-20 06:23:16,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.4672897196261683) internal successors, (157), 107 states have internal predecessors, (157), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:23:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 213 transitions. [2024-11-20 06:23:16,557 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 213 transitions. Word has length 195 [2024-11-20 06:23:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:16,557 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 213 transitions. [2024-11-20 06:23:16,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:23:16,558 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 213 transitions. [2024-11-20 06:23:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 06:23:16,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:16,564 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:16,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:23:16,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:16,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 374485041, now seen corresponding path program 1 times [2024-11-20 06:23:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:16,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450524565] [2024-11-20 06:23:16,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:16,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:16,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450524565] [2024-11-20 06:23:16,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450524565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:16,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:16,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:23:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749215148] [2024-11-20 06:23:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:16,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:23:16,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:23:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:16,983 INFO L87 Difference]: Start difference. First operand 137 states and 213 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:17,114 INFO L93 Difference]: Finished difference Result 271 states and 423 transitions. [2024-11-20 06:23:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:23:17,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2024-11-20 06:23:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:17,121 INFO L225 Difference]: With dead ends: 271 [2024-11-20 06:23:17,121 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 06:23:17,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:17,123 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:17,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:23:17,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 06:23:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-20 06:23:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 107 states have internal predecessors, (156), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:23:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 212 transitions. [2024-11-20 06:23:17,150 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 212 transitions. Word has length 195 [2024-11-20 06:23:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:17,153 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 212 transitions. [2024-11-20 06:23:17,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:17,153 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 212 transitions. [2024-11-20 06:23:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-20 06:23:17,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:17,157 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:17,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:23:17,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:17,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:17,158 INFO L85 PathProgramCache]: Analyzing trace with hash 27655192, now seen corresponding path program 1 times [2024-11-20 06:23:17,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:17,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539314500] [2024-11-20 06:23:17,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:17,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:17,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:17,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539314500] [2024-11-20 06:23:17,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539314500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:17,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:23:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551895062] [2024-11-20 06:23:17,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:17,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:23:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:23:17,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:17,438 INFO L87 Difference]: Start difference. First operand 137 states and 212 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:17,570 INFO L93 Difference]: Finished difference Result 395 states and 616 transitions. [2024-11-20 06:23:17,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:23:17,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2024-11-20 06:23:17,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:17,576 INFO L225 Difference]: With dead ends: 395 [2024-11-20 06:23:17,579 INFO L226 Difference]: Without dead ends: 261 [2024-11-20 06:23:17,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:17,581 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 179 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:17,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 482 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:23:17,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-20 06:23:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2024-11-20 06:23:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 199 states have (on average 1.4321608040201006) internal successors, (285), 199 states have internal predecessors, (285), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:23:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 397 transitions. [2024-11-20 06:23:17,624 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 397 transitions. Word has length 197 [2024-11-20 06:23:17,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:17,625 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 397 transitions. [2024-11-20 06:23:17,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 397 transitions. [2024-11-20 06:23:17,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-20 06:23:17,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:17,629 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:17,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:23:17,630 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:17,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2113802532, now seen corresponding path program 1 times [2024-11-20 06:23:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007821221] [2024-11-20 06:23:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:17,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007821221] [2024-11-20 06:23:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007821221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:23:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439865721] [2024-11-20 06:23:17,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:17,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:23:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:17,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:23:17,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:17,821 INFO L87 Difference]: Start difference. First operand 258 states and 397 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:17,892 INFO L93 Difference]: Finished difference Result 766 states and 1181 transitions. [2024-11-20 06:23:17,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:23:17,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-11-20 06:23:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:17,900 INFO L225 Difference]: With dead ends: 766 [2024-11-20 06:23:17,901 INFO L226 Difference]: Without dead ends: 511 [2024-11-20 06:23:17,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:17,906 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 201 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:17,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 404 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:23:17,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-20 06:23:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 507. [2024-11-20 06:23:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 390 states have (on average 1.4205128205128206) internal successors, (554), 390 states have internal predecessors, (554), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-20 06:23:17,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 778 transitions. [2024-11-20 06:23:17,961 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 778 transitions. Word has length 198 [2024-11-20 06:23:17,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:17,962 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 778 transitions. [2024-11-20 06:23:17,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 778 transitions. [2024-11-20 06:23:17,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-20 06:23:17,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:17,967 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:17,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:23:17,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:17,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1594358750, now seen corresponding path program 1 times [2024-11-20 06:23:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505845108] [2024-11-20 06:23:17,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:18,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:18,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505845108] [2024-11-20 06:23:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505845108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:23:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355894586] [2024-11-20 06:23:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:23:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:23:18,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:18,279 INFO L87 Difference]: Start difference. First operand 507 states and 778 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:18,451 INFO L93 Difference]: Finished difference Result 1275 states and 1964 transitions. [2024-11-20 06:23:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:23:18,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-11-20 06:23:18,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:18,458 INFO L225 Difference]: With dead ends: 1275 [2024-11-20 06:23:18,458 INFO L226 Difference]: Without dead ends: 771 [2024-11-20 06:23:18,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:18,460 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 192 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:18,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 444 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:23:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-11-20 06:23:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 767. [2024-11-20 06:23:18,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 592 states have (on average 1.4256756756756757) internal successors, (844), 592 states have internal predecessors, (844), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-20 06:23:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1180 transitions. [2024-11-20 06:23:18,509 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1180 transitions. Word has length 198 [2024-11-20 06:23:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:18,510 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1180 transitions. [2024-11-20 06:23:18,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1180 transitions. [2024-11-20 06:23:18,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-20 06:23:18,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:18,513 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:18,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:23:18,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:18,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 951676014, now seen corresponding path program 1 times [2024-11-20 06:23:18,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:18,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272208142] [2024-11-20 06:23:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:18,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:18,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:18,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272208142] [2024-11-20 06:23:18,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272208142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:18,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:18,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:23:18,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290797031] [2024-11-20 06:23:18,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:18,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:23:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:18,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:23:18,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:23:18,823 INFO L87 Difference]: Start difference. First operand 767 states and 1180 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:19,030 INFO L93 Difference]: Finished difference Result 1555 states and 2392 transitions. [2024-11-20 06:23:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:23:19,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-11-20 06:23:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:19,036 INFO L225 Difference]: With dead ends: 1555 [2024-11-20 06:23:19,036 INFO L226 Difference]: Without dead ends: 785 [2024-11-20 06:23:19,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:23:19,040 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 182 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:19,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 855 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:23:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-20 06:23:19,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 775. [2024-11-20 06:23:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 600 states have (on average 1.4233333333333333) internal successors, (854), 600 states have internal predecessors, (854), 168 states have call successors, (168), 6 states have call predecessors, (168), 6 states have return successors, (168), 168 states have call predecessors, (168), 168 states have call successors, (168) [2024-11-20 06:23:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1190 transitions. [2024-11-20 06:23:19,103 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1190 transitions. Word has length 198 [2024-11-20 06:23:19,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:19,107 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1190 transitions. [2024-11-20 06:23:19,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:19,107 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1190 transitions. [2024-11-20 06:23:19,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-20 06:23:19,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:19,110 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:19,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:23:19,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:19,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:19,111 INFO L85 PathProgramCache]: Analyzing trace with hash -853762320, now seen corresponding path program 1 times [2024-11-20 06:23:19,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:19,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670917029] [2024-11-20 06:23:19,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:19,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:19,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:19,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:19,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670917029] [2024-11-20 06:23:19,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670917029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:19,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:23:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020258433] [2024-11-20 06:23:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:23:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:19,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:23:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:23:19,538 INFO L87 Difference]: Start difference. First operand 775 states and 1190 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:19,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:19,871 INFO L93 Difference]: Finished difference Result 2055 states and 3158 transitions. [2024-11-20 06:23:19,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:23:19,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 198 [2024-11-20 06:23:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:19,883 INFO L225 Difference]: With dead ends: 2055 [2024-11-20 06:23:19,883 INFO L226 Difference]: Without dead ends: 1283 [2024-11-20 06:23:19,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:23:19,886 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 189 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:19,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 443 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:23:19,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-20 06:23:19,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1039. [2024-11-20 06:23:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 806 states have (on average 1.4267990074441688) internal successors, (1150), 806 states have internal predecessors, (1150), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-20 06:23:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1598 transitions. [2024-11-20 06:23:19,977 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1598 transitions. Word has length 198 [2024-11-20 06:23:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:19,978 INFO L471 AbstractCegarLoop]: Abstraction has 1039 states and 1598 transitions. [2024-11-20 06:23:19,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1598 transitions. [2024-11-20 06:23:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-20 06:23:19,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:19,982 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:19,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:23:19,983 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:19,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash 40219654, now seen corresponding path program 1 times [2024-11-20 06:23:19,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:19,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706301790] [2024-11-20 06:23:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:19,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:21,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706301790] [2024-11-20 06:23:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706301790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:21,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:23:21,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554832601] [2024-11-20 06:23:21,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:21,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:23:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:23:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:23:21,602 INFO L87 Difference]: Start difference. First operand 1039 states and 1598 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:24,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:24,547 INFO L93 Difference]: Finished difference Result 5505 states and 8347 transitions. [2024-11-20 06:23:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 06:23:24,548 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 199 [2024-11-20 06:23:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:24,572 INFO L225 Difference]: With dead ends: 5505 [2024-11-20 06:23:24,573 INFO L226 Difference]: Without dead ends: 4733 [2024-11-20 06:23:24,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-20 06:23:24,578 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1676 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1676 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:24,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1676 Valid, 2134 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 06:23:24,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4733 states. [2024-11-20 06:23:24,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4733 to 2153. [2024-11-20 06:23:24,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2153 states, 1688 states have (on average 1.4312796208530805) internal successors, (2416), 1688 states have internal predecessors, (2416), 448 states have call successors, (448), 16 states have call predecessors, (448), 16 states have return successors, (448), 448 states have call predecessors, (448), 448 states have call successors, (448) [2024-11-20 06:23:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2153 states to 2153 states and 3312 transitions. [2024-11-20 06:23:24,898 INFO L78 Accepts]: Start accepts. Automaton has 2153 states and 3312 transitions. Word has length 199 [2024-11-20 06:23:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:24,899 INFO L471 AbstractCegarLoop]: Abstraction has 2153 states and 3312 transitions. [2024-11-20 06:23:24,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2153 states and 3312 transitions. [2024-11-20 06:23:24,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-20 06:23:24,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:24,904 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:24,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:23:24,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:24,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1887671558, now seen corresponding path program 1 times [2024-11-20 06:23:24,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:24,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861447030] [2024-11-20 06:23:24,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:24,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:25,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 27 proven. 54 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:23:25,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:25,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861447030] [2024-11-20 06:23:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861447030] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:23:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934735591] [2024-11-20 06:23:25,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:25,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:23:25,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:23:25,320 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:23:25,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 06:23:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:25,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 06:23:25,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:23:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 763 proven. 33 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-20 06:23:25,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:23:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 48 proven. 33 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:23:26,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934735591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:23:26,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:23:26,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-11-20 06:23:26,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008124541] [2024-11-20 06:23:26,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:23:26,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 06:23:26,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:26,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 06:23:26,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-20 06:23:26,013 INFO L87 Difference]: Start difference. First operand 2153 states and 3312 transitions. Second operand has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-11-20 06:23:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:26,832 INFO L93 Difference]: Finished difference Result 5133 states and 7686 transitions. [2024-11-20 06:23:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 06:23:26,833 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) Word has length 199 [2024-11-20 06:23:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:26,855 INFO L225 Difference]: With dead ends: 5133 [2024-11-20 06:23:26,855 INFO L226 Difference]: Without dead ends: 2937 [2024-11-20 06:23:26,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2024-11-20 06:23:26,865 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 463 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:26,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 509 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:23:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2937 states. [2024-11-20 06:23:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 1363. [2024-11-20 06:23:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1064 states have (on average 1.3590225563909775) internal successors, (1446), 1070 states have internal predecessors, (1446), 266 states have call successors, (266), 32 states have call predecessors, (266), 32 states have return successors, (266), 260 states have call predecessors, (266), 266 states have call successors, (266) [2024-11-20 06:23:27,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1978 transitions. [2024-11-20 06:23:27,121 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1978 transitions. Word has length 199 [2024-11-20 06:23:27,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:27,122 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1978 transitions. [2024-11-20 06:23:27,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 4 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (59), 4 states have call predecessors, (59), 4 states have call successors, (59) [2024-11-20 06:23:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1978 transitions. [2024-11-20 06:23:27,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-20 06:23:27,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:27,126 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:27,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 06:23:27,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:23:27,331 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:27,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:27,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1855103570, now seen corresponding path program 1 times [2024-11-20 06:23:27,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:27,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119800296] [2024-11-20 06:23:27,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:27,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:27,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:27,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:27,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119800296] [2024-11-20 06:23:27,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119800296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:27,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:27,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:23:27,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480713155] [2024-11-20 06:23:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:23:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:23:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:27,471 INFO L87 Difference]: Start difference. First operand 1363 states and 1978 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:27,685 INFO L93 Difference]: Finished difference Result 3323 states and 4820 transitions. [2024-11-20 06:23:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:23:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 199 [2024-11-20 06:23:27,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:27,697 INFO L225 Difference]: With dead ends: 3323 [2024-11-20 06:23:27,698 INFO L226 Difference]: Without dead ends: 1963 [2024-11-20 06:23:27,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:23:27,703 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 110 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:27,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 452 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:23:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2024-11-20 06:23:27,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1617. [2024-11-20 06:23:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1318 states have (on average 1.3672230652503794) internal successors, (1802), 1324 states have internal predecessors, (1802), 266 states have call successors, (266), 32 states have call predecessors, (266), 32 states have return successors, (266), 260 states have call predecessors, (266), 266 states have call successors, (266) [2024-11-20 06:23:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2334 transitions. [2024-11-20 06:23:27,897 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2334 transitions. Word has length 199 [2024-11-20 06:23:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:27,898 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2334 transitions. [2024-11-20 06:23:27,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2334 transitions. [2024-11-20 06:23:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-20 06:23:27,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:27,902 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:27,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 06:23:27,903 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:27,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -165360089, now seen corresponding path program 1 times [2024-11-20 06:23:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:27,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320258307] [2024-11-20 06:23:27,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:27,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:28,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:28,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320258307] [2024-11-20 06:23:28,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320258307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:28,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:28,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:23:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89750030] [2024-11-20 06:23:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:28,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:23:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:28,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:23:28,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:23:28,232 INFO L87 Difference]: Start difference. First operand 1617 states and 2334 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:28,576 INFO L93 Difference]: Finished difference Result 3609 states and 5154 transitions. [2024-11-20 06:23:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:23:28,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 200 [2024-11-20 06:23:28,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:28,589 INFO L225 Difference]: With dead ends: 3609 [2024-11-20 06:23:28,589 INFO L226 Difference]: Without dead ends: 1995 [2024-11-20 06:23:28,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:23:28,594 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 343 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:28,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 581 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:23:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-11-20 06:23:28,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1651. [2024-11-20 06:23:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1359 states have (on average 1.3524650478292863) internal successors, (1838), 1365 states have internal predecessors, (1838), 259 states have call successors, (259), 32 states have call predecessors, (259), 32 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2024-11-20 06:23:28,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2356 transitions. [2024-11-20 06:23:28,825 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2356 transitions. Word has length 200 [2024-11-20 06:23:28,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:28,827 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2356 transitions. [2024-11-20 06:23:28,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:28,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2356 transitions. [2024-11-20 06:23:28,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 06:23:28,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:28,829 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:28,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 06:23:28,830 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:28,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1209851167, now seen corresponding path program 1 times [2024-11-20 06:23:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710865028] [2024-11-20 06:23:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:23:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:23:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:23:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 06:23:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 06:23:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 06:23:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:23:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 06:23:29,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 06:23:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 06:23:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 06:23:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:23:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 06:23:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:23:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 06:23:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:23:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:23:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 06:23:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 06:23:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 06:23:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 06:23:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 06:23:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 06:23:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 06:23:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 06:23:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 06:23:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 06:23:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 06:23:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:23:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:23:29,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710865028] [2024-11-20 06:23:29,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710865028] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:23:29,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049345358] [2024-11-20 06:23:29,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:29,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:23:29,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:23:29,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:23:29,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 06:23:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:29,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 06:23:29,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:23:29,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-20 06:23:29,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:23:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:23:29,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049345358] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:23:29,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:23:29,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-20 06:23:29,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045335327] [2024-11-20 06:23:29,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:23:29,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:23:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:23:29,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:23:29,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:23:29,960 INFO L87 Difference]: Start difference. First operand 1651 states and 2356 transitions. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-20 06:23:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:30,927 INFO L93 Difference]: Finished difference Result 5640 states and 7887 transitions. [2024-11-20 06:23:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 06:23:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 203 [2024-11-20 06:23:30,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:30,949 INFO L225 Difference]: With dead ends: 5640 [2024-11-20 06:23:30,950 INFO L226 Difference]: Without dead ends: 3992 [2024-11-20 06:23:30,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420 [2024-11-20 06:23:30,955 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 683 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:30,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 828 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:23:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3992 states. [2024-11-20 06:23:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 1772. [2024-11-20 06:23:31,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1489 states have (on average 1.3263935527199462) internal successors, (1975), 1501 states have internal predecessors, (1975), 242 states have call successors, (242), 40 states have call predecessors, (242), 40 states have return successors, (242), 230 states have call predecessors, (242), 242 states have call successors, (242) [2024-11-20 06:23:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2459 transitions. [2024-11-20 06:23:31,185 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2459 transitions. Word has length 203 [2024-11-20 06:23:31,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:31,186 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2459 transitions. [2024-11-20 06:23:31,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-20 06:23:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2459 transitions. [2024-11-20 06:23:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 06:23:31,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:31,189 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:31,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 06:23:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 06:23:31,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1350399777, now seen corresponding path program 1 times [2024-11-20 06:23:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:23:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052674867] [2024-11-20 06:23:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:23:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:23:31,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259692309] [2024-11-20 06:23:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:31,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:23:31,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:23:31,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:23:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 06:23:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:23:31,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:23:31,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:23:31,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:23:31,904 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:23:31,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:23:31,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 06:23:32,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:23:32,111 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:32,253 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:23:32,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:23:32 BoogieIcfgContainer [2024-11-20 06:23:32,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:23:32,258 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:23:32,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:23:32,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:23:32,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:15" (3/4) ... [2024-11-20 06:23:32,264 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:23:32,265 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:23:32,266 INFO L158 Benchmark]: Toolchain (without parser) took 18062.49ms. Allocated memory was 167.8MB in the beginning and 474.0MB in the end (delta: 306.2MB). Free memory was 136.8MB in the beginning and 375.5MB in the end (delta: -238.8MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-20 06:23:32,266 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:23:32,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.27ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 117.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 06:23:32,266 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.54ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 111.6MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 06:23:32,266 INFO L158 Benchmark]: Boogie Preprocessor took 86.08ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 104.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 06:23:32,267 INFO L158 Benchmark]: RCFGBuilder took 880.45ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 132.5MB in the end (delta: -28.1MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-11-20 06:23:32,267 INFO L158 Benchmark]: TraceAbstraction took 16615.63ms. Allocated memory was 167.8MB in the beginning and 474.0MB in the end (delta: 306.2MB). Free memory was 131.8MB in the beginning and 375.5MB in the end (delta: -243.7MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. [2024-11-20 06:23:32,267 INFO L158 Benchmark]: Witness Printer took 6.53ms. Allocated memory is still 474.0MB. Free memory is still 375.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:23:32,268 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.16ms. Allocated memory is still 167.8MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.27ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 117.8MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.54ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 111.6MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.08ms. Allocated memory is still 167.8MB. Free memory was 111.6MB in the beginning and 104.4MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 880.45ms. Allocated memory is still 167.8MB. Free memory was 104.4MB in the beginning and 132.5MB in the end (delta: -28.1MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16615.63ms. Allocated memory was 167.8MB in the beginning and 474.0MB in the end (delta: 306.2MB). Free memory was 131.8MB in the beginning and 375.5MB in the end (delta: -243.7MB). Peak memory consumption was 62.6MB. Max. memory is 16.1GB. * Witness Printer took 6.53ms. Allocated memory is still 474.0MB. Free memory is still 375.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of shiftRight at line 107, overapproximation of bitwiseOr at line 116, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryDOUBLEComparisonOperation at line 202. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = -0.5; [L23] unsigned char var_1_2 = 0; [L24] float var_1_4 = 32.5; [L25] float var_1_5 = 10.25; [L26] float var_1_6 = 15.2; [L27] unsigned short int var_1_7 = 1; [L28] unsigned short int var_1_10 = 1; [L29] signed short int var_1_12 = 8; [L30] signed short int var_1_13 = -16; [L31] unsigned long int var_1_16 = 0; [L32] unsigned long int var_1_17 = 1790089366; [L33] unsigned long int var_1_18 = 1816612959; [L34] unsigned long int var_1_19 = 2; [L35] unsigned char var_1_20 = 32; [L36] unsigned char var_1_21 = 32; [L37] unsigned short int var_1_22 = 256; [L38] unsigned short int var_1_23 = 21380; [L39] signed char var_1_25 = 8; [L40] signed char var_1_26 = 0; [L41] signed char var_1_27 = 32; [L42] signed char var_1_28 = 32; [L43] double var_1_29 = 99999999.2; [L44] double var_1_31 = 64.25; [L45] double var_1_32 = 100.6; [L46] unsigned char var_1_33 = 0; [L47] unsigned char var_1_34 = 0; [L48] unsigned short int var_1_35 = 4; [L49] unsigned long int last_1_var_1_16 = 0; [L50] unsigned long int last_1_var_1_19 = 2; [L51] unsigned char last_1_var_1_20 = 32; [L52] signed char last_1_var_1_25 = 8; [L53] unsigned char last_1_var_1_33 = 0; VAL [isInitial=0, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L195] last_1_var_1_16 = var_1_16 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_20 = var_1_20 [L198] last_1_var_1_25 = var_1_25 [L199] last_1_var_1_33 = var_1_33 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=0, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L149] var_1_2 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L150] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L151] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_4=65/2, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L152] var_1_4 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_5=41/4, var_1_6=76/5, var_1_7=1] [L154] var_1_5 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=76/5, var_1_7=1] [L156] var_1_6 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=1, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L158] var_1_10 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L159] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L160] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=8, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L161] var_1_12 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_12 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L162] RET assume_abort_if_not(var_1_12 >= -32768) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L163] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L164] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1790089366, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L165] var_1_17 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_17 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L166] RET assume_abort_if_not(var_1_17 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_17 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L167] RET assume_abort_if_not(var_1_17 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=1816612959, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L168] var_1_18 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_18 >= 1610612735) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L169] RET assume_abort_if_not(var_1_18 >= 1610612735) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L170] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L171] var_1_21 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L172] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L173] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=21380, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L174] var_1_23 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_23 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L175] RET assume_abort_if_not(var_1_23 >= 16383) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] CALL assume_abort_if_not(var_1_23 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L176] RET assume_abort_if_not(var_1_23 <= 32767) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L177] var_1_26 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_26 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L178] RET assume_abort_if_not(var_1_26 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L179] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=32, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L180] var_1_27 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L181] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L182] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=32, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L183] var_1_28 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_28 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L184] RET assume_abort_if_not(var_1_28 >= -127) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L185] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_31=257/4, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L186] var_1_31 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L187] RET assume_abort_if_not((var_1_31 >= -461168.6018427382800e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 4611686.018427382800e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_32=503/5, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L188] var_1_32 = __VERIFIER_nondet_double() [L189] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L189] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L190] var_1_34 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_35=4, var_1_7=1] [L191] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_35=4, var_1_7=1] [L192] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L192] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L210] RET updateVariables() [L211] CALL step() [L57] COND FALSE !(\read(last_1_var_1_33)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=8, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L66] COND TRUE var_1_6 == (- (99.4f * var_1_4)) [L67] var_1_25 = (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] EXPR var_1_10 & last_1_var_1_25 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=32, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L75] unsigned long int stepLocal_3 = last_1_var_1_16 * (var_1_10 & last_1_var_1_25); [L76] COND FALSE !(\read(last_1_var_1_33)) [L85] var_1_20 = 100 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L87] signed char stepLocal_2 = var_1_25; [L88] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=0, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L89] COND TRUE stepLocal_2 <= last_1_var_1_16 [L90] var_1_16 = ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L96] unsigned long int stepLocal_5 = var_1_16; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_5=3808567485, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=499999996/5, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_7=1] [L97] COND FALSE !(var_1_18 >= stepLocal_5) [L104] var_1_29 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=4, var_1_6=2, var_1_7=1] [L106] var_1_35 = var_1_7 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR var_1_20 >> var_1_12 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] EXPR ((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=-16, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L107] COND TRUE (var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12)))) [L108] var_1_13 = 8 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L112] COND FALSE !(var_1_13 >= var_1_18) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L115] signed short int stepLocal_6 = var_1_13; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] EXPR var_1_20 ^ var_1_23 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, stepLocal_6=8, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L116] COND FALSE !((var_1_20 ^ var_1_23) > stepLocal_6) [L121] COND TRUE \read(var_1_2) [L122] var_1_33 = 0 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L127] unsigned long int stepLocal_0 = var_1_19; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L128] COND FALSE !(\read(var_1_33)) [L135] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L137] unsigned char stepLocal_4 = var_1_20; VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, stepLocal_4=100, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L138] COND FALSE !(stepLocal_4 < var_1_20) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=256, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L141] COND FALSE !(\read(var_1_33)) [L144] var_1_22 = 2 VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, stepLocal_0=2, stepLocal_1=1, stepLocal_3=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L211] RET step() [L212] CALL, EXPR property() [L202] EXPR ((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202] EXPR (((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34)))) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L202-L203] return ((((((((((var_1_33 ? (((-5 + 64) < var_1_19) ? (var_1_1 == ((float) (((((var_1_4 - var_1_5)) > ((var_1_6 - 5.4f))) ? ((var_1_4 - var_1_5)) : ((var_1_6 - 5.4f)))))) : (var_1_1 == ((float) var_1_6))) : (var_1_1 == ((float) var_1_6))) && (last_1_var_1_33 ? (last_1_var_1_33 ? (var_1_7 == ((unsigned short int) (((((last_1_var_1_20 + last_1_var_1_20)) > (last_1_var_1_20)) ? ((last_1_var_1_20 + last_1_var_1_20)) : (last_1_var_1_20))))) : ((((last_1_var_1_20 + last_1_var_1_25) / var_1_12) <= last_1_var_1_20) ? (var_1_7 == ((unsigned short int) last_1_var_1_20)) : 1)) : 1)) && (((var_1_20 - var_1_20) == ((((var_1_20) < ((var_1_20 >> var_1_12))) ? (var_1_20) : ((var_1_20 >> var_1_12))))) ? (var_1_13 == ((signed short int) 8)) : (var_1_13 == ((signed short int) ((((var_1_25) > (var_1_25)) ? (var_1_25) : (var_1_25))))))) && ((var_1_25 <= last_1_var_1_16) ? (var_1_16 == ((unsigned long int) ((((((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) < 0 ) ? -((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))) : ((((3808567585u) < 0 ) ? -(3808567585u) : (3808567585u))))) - var_1_20))) : ((last_1_var_1_16 == var_1_7) ? (var_1_16 == ((unsigned long int) (((var_1_17 + var_1_18) - last_1_var_1_16) - var_1_20))) : 1))) && ((var_1_13 >= var_1_18) ? (var_1_19 == ((unsigned long int) ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20))))) : 1)) && (last_1_var_1_33 ? (((last_1_var_1_16 * (var_1_10 & last_1_var_1_25)) > last_1_var_1_20) ? (last_1_var_1_33 ? (var_1_20 == ((unsigned char) var_1_21)) : (var_1_20 == ((unsigned char) var_1_21))) : 1) : (var_1_20 == ((unsigned char) 100)))) && ((var_1_20 < var_1_20) ? (var_1_22 == ((unsigned short int) ((((((var_1_16 + 16) + (var_1_23 - var_1_21))) < (var_1_20)) ? (((var_1_16 + 16) + (var_1_23 - var_1_21))) : (var_1_20))))) : (var_1_33 ? (var_1_22 == ((unsigned short int) var_1_20)) : (var_1_22 == ((unsigned short int) 2))))) && ((var_1_6 == (- (99.4f * var_1_4))) ? (var_1_25 == ((signed char) (((((var_1_26 + var_1_27)) < (var_1_28)) ? ((var_1_26 + var_1_27)) : (var_1_28))))) : (((last_1_var_1_20 ^ last_1_var_1_19) < last_1_var_1_20) ? (var_1_25 == ((signed char) var_1_27)) : (var_1_25 == ((signed char) var_1_26))))) && ((var_1_18 >= var_1_16) ? (((- var_1_6) <= var_1_4) ? (var_1_29 == ((double) ((((var_1_5) > ((var_1_6 - var_1_4))) ? (var_1_5) : ((var_1_6 - var_1_4)))))) : (var_1_29 == ((double) (1.0000000000002E12 + ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_32)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) : (var_1_32))))))) : (var_1_29 == ((double) var_1_6)))) && (((var_1_20 ^ var_1_23) > var_1_13) ? ((! (var_1_18 == (var_1_20 + var_1_7))) ? (var_1_33 == ((unsigned char) var_1_34)) : 1) : (var_1_2 ? (var_1_33 == ((unsigned char) 0)) : (var_1_33 == ((unsigned char) var_1_34))))) && (var_1_35 == ((unsigned short int) var_1_7)) ; [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=0, last_1_var_1_19=2, last_1_var_1_20=32, last_1_var_1_25=8, last_1_var_1_33=0, var_1_10=0, var_1_12=41, var_1_13=8, var_1_16=3808567485, var_1_17=1610612735, var_1_18=-2684354561, var_1_19=2, var_1_1=2, var_1_20=100, var_1_21=0, var_1_22=2, var_1_23=16383, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=2, var_1_2=1, var_1_33=0, var_1_34=0, var_1_35=1, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 13, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4245 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4218 mSDsluCounter, 7718 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4834 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3016 IncrementalHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 2884 mSDtfsCounter, 3016 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1600 GetRequests, 1528 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2153occurred in iteration=8, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 7329 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 3187 NumberOfCodeBlocks, 3187 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3167 ConstructedInterpolants, 0 QuantifiedInterpolants, 6093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 922 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 23937/24192 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:23:32,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:23:34,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:23:34,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:23:34,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:23:34,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:23:34,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:23:34,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:23:34,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:23:34,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:23:34,709 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:23:34,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:23:34,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:23:34,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:23:34,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:23:34,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:23:34,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:23:34,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:23:34,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:23:34,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:23:34,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:23:34,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:23:34,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:23:34,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:23:34,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:23:34,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:23:34,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:23:34,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:23:34,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:23:34,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:23:34,719 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:23:34,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:23:34,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:23:34,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:23:34,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:23:34,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:23:34,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:23:34,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:23:34,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:23:34,724 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:23:34,724 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:23:34,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:23:34,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:23:34,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:23:34,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:23:34,726 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20dc1fb0767de0807b7ef890f247a843538519c2d9a410bda6969ecc28831a46 [2024-11-20 06:23:35,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:23:35,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:23:35,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:23:35,069 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:23:35,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:23:35,071 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2024-11-20 06:23:36,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:23:36,826 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:23:36,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i [2024-11-20 06:23:36,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615ecf3b7/37778ba7b38e45d0a55c14ba3820483f/FLAGb076fc46c [2024-11-20 06:23:36,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/615ecf3b7/37778ba7b38e45d0a55c14ba3820483f [2024-11-20 06:23:36,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:23:36,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:23:36,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:23:36,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:23:36,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:23:36,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:36" (1/1) ... [2024-11-20 06:23:36,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f079027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:36, skipping insertion in model container [2024-11-20 06:23:36,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:23:36" (1/1) ... [2024-11-20 06:23:36,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:23:37,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i[916,929] [2024-11-20 06:23:37,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:23:37,232 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:23:37,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-36.i[916,929] [2024-11-20 06:23:37,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:23:37,334 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:23:37,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37 WrapperNode [2024-11-20 06:23:37,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:23:37,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:23:37,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:23:37,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:23:37,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,414 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-20 06:23:37,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:23:37,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:23:37,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:23:37,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:23:37,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:23:37,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:23:37,493 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:23:37,494 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:23:37,494 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:23:37,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (1/1) ... [2024-11-20 06:23:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:23:37,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:23:37,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:23:37,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:23:37,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:23:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:23:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:23:37,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:23:37,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:23:37,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:23:37,667 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:23:37,670 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:23:42,646 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-20 06:23:42,646 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:23:42,662 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:23:42,664 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:23:42,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:42 BoogieIcfgContainer [2024-11-20 06:23:42,664 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:23:42,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:23:42,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:23:42,671 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:23:42,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:23:36" (1/3) ... [2024-11-20 06:23:42,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8b1d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:42, skipping insertion in model container [2024-11-20 06:23:42,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:23:37" (2/3) ... [2024-11-20 06:23:42,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b8b1d71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:23:42, skipping insertion in model container [2024-11-20 06:23:42,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:23:42" (3/3) ... [2024-11-20 06:23:42,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-36.i [2024-11-20 06:23:42,688 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:23:42,689 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:23:42,747 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:23:42,756 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1dfe9bb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:23:42,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:23:42,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:23:42,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-20 06:23:42,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:42,780 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:42,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:42,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1568810157, now seen corresponding path program 1 times [2024-11-20 06:23:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:23:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402502325] [2024-11-20 06:23:42,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:42,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:23:42,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:23:42,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:23:42,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:23:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:43,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:23:43,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:23:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 422 proven. 0 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-11-20 06:23:43,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:23:43,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:23:43,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402502325] [2024-11-20 06:23:43,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402502325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:43,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:43,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:23:43,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381444572] [2024-11-20 06:23:43,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:43,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:23:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:23:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:23:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:23:43,300 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:23:43,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:43,327 INFO L93 Difference]: Finished difference Result 175 states and 306 transitions. [2024-11-20 06:23:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:23:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-20 06:23:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:43,338 INFO L225 Difference]: With dead ends: 175 [2024-11-20 06:23:43,339 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 06:23:43,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:23:43,349 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:43,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:23:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 06:23:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 06:23:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:23:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2024-11-20 06:23:43,412 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 183 [2024-11-20 06:23:43,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:43,413 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2024-11-20 06:23:43,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 06:23:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2024-11-20 06:23:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-20 06:23:43,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:43,417 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:43,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 06:23:43,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:23:43,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:43,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1525949237, now seen corresponding path program 1 times [2024-11-20 06:23:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:23:43,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301048705] [2024-11-20 06:23:43,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:43,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:23:43,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:23:43,623 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:23:43,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:23:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:43,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 06:23:44,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:23:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 06:23:44,317 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:23:44,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:23:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301048705] [2024-11-20 06:23:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301048705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:44,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:44,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:23:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109314995] [2024-11-20 06:23:44,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:44,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:23:44,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:23:44,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:23:44,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:23:44,323 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:48,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:23:51,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:23:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:51,876 INFO L93 Difference]: Finished difference Result 255 states and 399 transitions. [2024-11-20 06:23:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:23:51,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-20 06:23:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:51,881 INFO L225 Difference]: With dead ends: 255 [2024-11-20 06:23:51,881 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 06:23:51,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:23:51,883 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 115 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:51,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 479 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-11-20 06:23:51,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 06:23:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2024-11-20 06:23:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:23:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 263 transitions. [2024-11-20 06:23:51,927 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 263 transitions. Word has length 183 [2024-11-20 06:23:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:51,928 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 263 transitions. [2024-11-20 06:23:51,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 263 transitions. [2024-11-20 06:23:51,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-20 06:23:51,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:51,932 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:51,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:23:52,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:23:52,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:52,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:52,134 INFO L85 PathProgramCache]: Analyzing trace with hash 113287978, now seen corresponding path program 1 times [2024-11-20 06:23:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:23:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190732215] [2024-11-20 06:23:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:52,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:23:52,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:23:52,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:23:52,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 06:23:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:52,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 06:23:52,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:23:52,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 06:23:52,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:23:52,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:23:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190732215] [2024-11-20 06:23:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190732215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:23:52,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:23:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:23:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479753710] [2024-11-20 06:23:52,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:23:52,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:23:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:23:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:23:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:23:52,943 INFO L87 Difference]: Start difference. First operand 168 states and 263 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:58,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 06:23:58,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:23:58,286 INFO L93 Difference]: Finished difference Result 347 states and 533 transitions. [2024-11-20 06:23:58,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:23:58,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-20 06:23:58,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:23:58,325 INFO L225 Difference]: With dead ends: 347 [2024-11-20 06:23:58,325 INFO L226 Difference]: Without dead ends: 182 [2024-11-20 06:23:58,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:23:58,327 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 139 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:23:58,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 229 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-20 06:23:58,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-20 06:23:58,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2024-11-20 06:23:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 113 states have internal predecessors, (149), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-20 06:23:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 261 transitions. [2024-11-20 06:23:58,370 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 261 transitions. Word has length 184 [2024-11-20 06:23:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:23:58,372 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 261 transitions. [2024-11-20 06:23:58,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 06:23:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 261 transitions. [2024-11-20 06:23:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-20 06:23:58,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:23:58,376 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:23:58,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 06:23:58,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:23:58,580 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:23:58,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:23:58,580 INFO L85 PathProgramCache]: Analyzing trace with hash 115135020, now seen corresponding path program 1 times [2024-11-20 06:23:58,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:23:58,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823358072] [2024-11-20 06:23:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:23:58,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:23:58,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:23:58,585 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:23:58,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 06:23:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:23:58,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 06:23:58,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:24:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 352 proven. 141 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2024-11-20 06:24:07,354 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:24:18,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:24:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823358072] [2024-11-20 06:24:18,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823358072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:24:18,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2005205283] [2024-11-20 06:24:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:24:18,367 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 06:24:18,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 06:24:18,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 06:24:18,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 06:24:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:24:19,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 06:24:19,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:24:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 352 proven. 141 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2024-11-20 06:24:27,701 INFO L311 TraceCheckSpWp]: Computing backward predicates...