./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.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 c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:25:51,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:25:51,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:25:51,919 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:25:51,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:25:51,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:25:51,949 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:25:51,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:25:51,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:25:51,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:25:51,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:25:51,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:25:51,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:25:51,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:25:51,952 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:25:51,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:25:51,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:25:51,953 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:25:51,953 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:25:51,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:25:51,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:25:51,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:25:51,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:25:51,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:25:51,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:25:51,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:25:51,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:25:51,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:25:51,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:25:51,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:25:51,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:25:51,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:25:51,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:51,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:25:51,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:25:51,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:25:51,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:25:51,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:25:51,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:25:51,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:25:51,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:25:51,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:25:51,965 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 -> c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 [2024-11-08 23:25:52,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:25:52,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:25:52,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:25:52,261 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:25:52,261 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:25:52,262 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2024-11-08 23:25:53,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:25:53,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:25:53,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2024-11-08 23:25:53,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7accf8c1/8e40da96339d4bd3819b1161ee17426a/FLAG44c34c663 [2024-11-08 23:25:53,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7accf8c1/8e40da96339d4bd3819b1161ee17426a [2024-11-08 23:25:53,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:25:53,944 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:25:53,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:53,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:25:53,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:25:53,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:53" (1/1) ... [2024-11-08 23:25:53,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34fd16fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:53, skipping insertion in model container [2024-11-08 23:25:53,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:25:53" (1/1) ... [2024-11-08 23:25:53,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:25:54,141 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-1loop_file-93.i[916,929] [2024-11-08 23:25:54,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:54,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:25:54,244 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-1loop_file-93.i[916,929] [2024-11-08 23:25:54,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:25:54,309 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:25:54,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54 WrapperNode [2024-11-08 23:25:54,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:25:54,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:54,312 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:25:54,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:25:54,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,386 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2024-11-08 23:25:54,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:25:54,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:25:54,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:25:54,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:25:54,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,480 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-08 23:25:54,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:25:54,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:25:54,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:25:54,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:25:54,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (1/1) ... [2024-11-08 23:25:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:25:54,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:54,553 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-08 23:25:54,564 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-08 23:25:54,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:25:54,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:25:54,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:25:54,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:25:54,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:25:54,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:25:54,666 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:25:54,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:25:55,132 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-08 23:25:55,132 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:25:55,150 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:25:55,151 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:25:55,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:55 BoogieIcfgContainer [2024-11-08 23:25:55,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:25:55,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:25:55,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:25:55,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:25:55,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:25:53" (1/3) ... [2024-11-08 23:25:55,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659e4ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:55, skipping insertion in model container [2024-11-08 23:25:55,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:25:54" (2/3) ... [2024-11-08 23:25:55,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659e4ee7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:25:55, skipping insertion in model container [2024-11-08 23:25:55,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:55" (3/3) ... [2024-11-08 23:25:55,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-93.i [2024-11-08 23:25:55,184 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:25:55,184 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:25:55,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:25:55,259 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;@6451af4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:25:55,259 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:25:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:25:55,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:55,280 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:25:55,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:55,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1875533615, now seen corresponding path program 1 times [2024-11-08 23:25:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998239867] [2024-11-08 23:25:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:25:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:25:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:25:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:25:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:25:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:25:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:25:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:25:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:25:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:25:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:25:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:25:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:25:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:25:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:25:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:25:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:25:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:25:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:55,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998239867] [2024-11-08 23:25:55,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998239867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:25:55,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741221195] [2024-11-08 23:25:55,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:55,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:25:55,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:25:55,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:25:55,822 INFO L87 Difference]: Start difference. First operand has 88 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:25:55,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:55,856 INFO L93 Difference]: Finished difference Result 171 states and 292 transitions. [2024-11-08 23:25:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:25:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-11-08 23:25:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:55,864 INFO L225 Difference]: With dead ends: 171 [2024-11-08 23:25:55,864 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 23:25:55,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-08 23:25:55,873 INFO L432 NwaCegarLoop]: 128 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, 128 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-08 23:25:55,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:25:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 23:25:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 23:25:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-08 23:25:55,918 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 155 [2024-11-08 23:25:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:55,918 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-08 23:25:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:25:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-08 23:25:55,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:25:55,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:55,923 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:25:55,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:25:55,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:55,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:55,924 INFO L85 PathProgramCache]: Analyzing trace with hash 577113943, now seen corresponding path program 1 times [2024-11-08 23:25:55,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:55,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221344810] [2024-11-08 23:25:55,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:55,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:25:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:25:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:25:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:25:56,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:25:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:25:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:25:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:25:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:25:56,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:25:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:25:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:25:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:25:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:25:56,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:25:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:25:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:25:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:25:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:56,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:56,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221344810] [2024-11-08 23:25:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221344810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:56,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:25:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529104617] [2024-11-08 23:25:56,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:56,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:25:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:56,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:25:56,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:25:56,284 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:56,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:56,389 INFO L93 Difference]: Finished difference Result 237 states and 361 transitions. [2024-11-08 23:25:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:25:56,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-08 23:25:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:56,393 INFO L225 Difference]: With dead ends: 237 [2024-11-08 23:25:56,393 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 23:25:56,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-08 23:25:56,395 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 112 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:56,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 335 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:25:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 23:25:56,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 83. [2024-11-08 23:25:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:25:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-11-08 23:25:56,426 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 155 [2024-11-08 23:25:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:56,432 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-11-08 23:25:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-11-08 23:25:56,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:25:56,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:56,434 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:25:56,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:25:56,435 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:56,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:56,435 INFO L85 PathProgramCache]: Analyzing trace with hash -434003307, now seen corresponding path program 1 times [2024-11-08 23:25:56,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:56,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306886413] [2024-11-08 23:25:56,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:56,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:25:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:25:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:25:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:25:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:25:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:25:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:25:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:25:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:25:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:25:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:25:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:25:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:25:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:25:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:25:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:25:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:25:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:25:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306886413] [2024-11-08 23:25:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306886413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:25:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508392292] [2024-11-08 23:25:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:56,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:25:56,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:56,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:25:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:25:56,863 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:57,133 INFO L93 Difference]: Finished difference Result 243 states and 368 transitions. [2024-11-08 23:25:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 23:25:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-08 23:25:57,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:57,137 INFO L225 Difference]: With dead ends: 243 [2024-11-08 23:25:57,139 INFO L226 Difference]: Without dead ends: 163 [2024-11-08 23:25:57,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 23:25:57,142 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 113 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:57,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 589 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:25:57,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-08 23:25:57,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 129. [2024-11-08 23:25:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:25:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 194 transitions. [2024-11-08 23:25:57,180 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 194 transitions. Word has length 155 [2024-11-08 23:25:57,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:57,180 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 194 transitions. [2024-11-08 23:25:57,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:57,181 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 194 transitions. [2024-11-08 23:25:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-08 23:25:57,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:57,186 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:25:57,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:25:57,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:57,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash -939970739, now seen corresponding path program 1 times [2024-11-08 23:25:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142759859] [2024-11-08 23:25:57,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:25:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:25:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:25:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:25:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:25:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:25:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:25:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:25:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:25:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:25:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:25:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:25:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:25:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:25:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:25:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:25:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:25:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:25:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:57,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:57,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142759859] [2024-11-08 23:25:57,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142759859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:57,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:25:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89230276] [2024-11-08 23:25:57,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:57,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:25:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:57,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:25:57,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:25:57,585 INFO L87 Difference]: Start difference. First operand 129 states and 194 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:57,768 INFO L93 Difference]: Finished difference Result 244 states and 368 transitions. [2024-11-08 23:25:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:25:57,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-08 23:25:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:57,771 INFO L225 Difference]: With dead ends: 244 [2024-11-08 23:25:57,774 INFO L226 Difference]: Without dead ends: 163 [2024-11-08 23:25:57,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-08 23:25:57,776 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 80 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:57,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 334 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:25:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-08 23:25:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2024-11-08 23:25:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:25:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2024-11-08 23:25:57,813 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 155 [2024-11-08 23:25:57,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:57,814 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2024-11-08 23:25:57,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:57,815 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2024-11-08 23:25:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:25:57,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:57,817 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:25:57,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:25:57,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:57,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1226461686, now seen corresponding path program 1 times [2024-11-08 23:25:57,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:57,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680923366] [2024-11-08 23:25:57,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:57,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:25:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:25:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:25:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:25:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:25:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:25:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:25:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:25:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:25:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:25:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:25:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:25:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:25:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:25:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:25:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:25:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:25:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:25:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:25:58,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:58,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680923366] [2024-11-08 23:25:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680923366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:25:58,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:25:58,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:25:58,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120115057] [2024-11-08 23:25:58,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:25:58,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:25:58,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:58,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:25:58,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:25:58,233 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:58,333 INFO L93 Difference]: Finished difference Result 387 states and 582 transitions. [2024-11-08 23:25:58,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:25:58,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2024-11-08 23:25:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:58,337 INFO L225 Difference]: With dead ends: 387 [2024-11-08 23:25:58,338 INFO L226 Difference]: Without dead ends: 290 [2024-11-08 23:25:58,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:25:58,341 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 125 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:58,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 320 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:25:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-11-08 23:25:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 227. [2024-11-08 23:25:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 169 states have (on average 1.3964497041420119) internal successors, (236), 170 states have internal predecessors, (236), 53 states have call successors, (53), 4 states have call predecessors, (53), 4 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-08 23:25:58,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 342 transitions. [2024-11-08 23:25:58,367 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 342 transitions. Word has length 157 [2024-11-08 23:25:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:58,368 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 342 transitions. [2024-11-08 23:25:58,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:25:58,368 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 342 transitions. [2024-11-08 23:25:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:25:58,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:58,370 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:25:58,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 23:25:58,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:58,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 2047437256, now seen corresponding path program 1 times [2024-11-08 23:25:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:58,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593319193] [2024-11-08 23:25:58,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:25:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:25:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:25:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:25:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:25:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:25:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:25:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:25:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:25:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:25:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:25:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:25:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:25:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:25:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:25:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:25:58,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:25:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:25:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:25:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:25:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:25:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:25:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:25:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:25:58,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:25:58,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593319193] [2024-11-08 23:25:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593319193] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:25:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446421230] [2024-11-08 23:25:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:58,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:25:58,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:25:58,772 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-08 23:25:58,774 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-08 23:25:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:58,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:25:58,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:25:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-08 23:25:59,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:25:59,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:25:59,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446421230] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:25:59,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:25:59,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 23:25:59,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603784802] [2024-11-08 23:25:59,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:25:59,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 23:25:59,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:25:59,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 23:25:59,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:25:59,438 INFO L87 Difference]: Start difference. First operand 227 states and 342 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 23:25:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:25:59,666 INFO L93 Difference]: Finished difference Result 403 states and 598 transitions. [2024-11-08 23:25:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 23:25:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 157 [2024-11-08 23:25:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:25:59,670 INFO L225 Difference]: With dead ends: 403 [2024-11-08 23:25:59,670 INFO L226 Difference]: Without dead ends: 237 [2024-11-08 23:25:59,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 23:25:59,672 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 170 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:25:59,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 257 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:25:59,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-08 23:25:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 229. [2024-11-08 23:25:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 170 states have internal predecessors, (226), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-08 23:25:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 332 transitions. [2024-11-08 23:25:59,696 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 332 transitions. Word has length 157 [2024-11-08 23:25:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:25:59,697 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 332 transitions. [2024-11-08 23:25:59,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 23:25:59,698 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 332 transitions. [2024-11-08 23:25:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:25:59,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:25:59,699 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:25:59,718 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-08 23:25:59,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 23:25:59,900 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:25:59,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:25:59,901 INFO L85 PathProgramCache]: Analyzing trace with hash 767683020, now seen corresponding path program 1 times [2024-11-08 23:25:59,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:25:59,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279375049] [2024-11-08 23:25:59,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:25:59,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:25:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:25:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:26:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:26:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:26:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:26:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:26:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:26:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:26:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:26:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:26:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:26:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:26:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:26:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:26:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:26:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:26:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:26:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:26:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:26:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:26:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:00,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:26:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:00,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279375049] [2024-11-08 23:26:00,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279375049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:00,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:26:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513174209] [2024-11-08 23:26:00,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:00,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:26:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:26:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:26:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:26:00,084 INFO L87 Difference]: Start difference. First operand 229 states and 332 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:00,142 INFO L93 Difference]: Finished difference Result 488 states and 714 transitions. [2024-11-08 23:26:00,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:26:00,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2024-11-08 23:26:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:00,145 INFO L225 Difference]: With dead ends: 488 [2024-11-08 23:26:00,146 INFO L226 Difference]: Without dead ends: 332 [2024-11-08 23:26:00,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-08 23:26:00,147 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 110 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:00,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 308 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:26:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-08 23:26:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2024-11-08 23:26:00,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 246 states have internal predecessors, (326), 76 states have call successors, (76), 8 states have call predecessors, (76), 8 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-08 23:26:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 478 transitions. [2024-11-08 23:26:00,186 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 478 transitions. Word has length 157 [2024-11-08 23:26:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:00,187 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 478 transitions. [2024-11-08 23:26:00,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 478 transitions. [2024-11-08 23:26:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:26:00,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:00,189 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:00,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 23:26:00,189 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:00,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:00,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1025848458, now seen corresponding path program 1 times [2024-11-08 23:26:00,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:00,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307560389] [2024-11-08 23:26:00,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:00,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:26:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:26:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:26:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:26:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:26:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:26:01,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:26:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:26:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:26:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:26:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:26:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:26:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:26:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:26:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:26:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:26:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:26:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:26:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:26:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:26:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:01,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307560389] [2024-11-08 23:26:01,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307560389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:01,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:01,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 23:26:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462273324] [2024-11-08 23:26:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:01,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 23:26:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:26:01,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 23:26:01,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 23:26:01,298 INFO L87 Difference]: Start difference. First operand 330 states and 478 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:01,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:01,773 INFO L93 Difference]: Finished difference Result 1000 states and 1440 transitions. [2024-11-08 23:26:01,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:26:01,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2024-11-08 23:26:01,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:01,779 INFO L225 Difference]: With dead ends: 1000 [2024-11-08 23:26:01,780 INFO L226 Difference]: Without dead ends: 753 [2024-11-08 23:26:01,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:26:01,782 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 213 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:01,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 431 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 23:26:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2024-11-08 23:26:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 555. [2024-11-08 23:26:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 412 states have (on average 1.2718446601941749) internal successors, (524), 414 states have internal predecessors, (524), 129 states have call successors, (129), 13 states have call predecessors, (129), 13 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2024-11-08 23:26:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 782 transitions. [2024-11-08 23:26:01,855 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 782 transitions. Word has length 157 [2024-11-08 23:26:01,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:01,857 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 782 transitions. [2024-11-08 23:26:01,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:01,857 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 782 transitions. [2024-11-08 23:26:01,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 23:26:01,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:01,859 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:01,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 23:26:01,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1418875468, now seen corresponding path program 1 times [2024-11-08 23:26:01,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:01,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802692805] [2024-11-08 23:26:01,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:01,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:02,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:26:02,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:26:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:26:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:26:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:26:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:26:02,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:26:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:26:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:26:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:26:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:26:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:26:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:26:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:26:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:26:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:26:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:02,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:26:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:26:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:26:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:26:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802692805] [2024-11-08 23:26:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802692805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:26:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687466599] [2024-11-08 23:26:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:02,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:26:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:26:02,410 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-08 23:26:02,412 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-08 23:26:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:02,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 23:26:02,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 694 proven. 72 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-08 23:26:03,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:26:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-08 23:26:04,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687466599] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:26:04,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:26:04,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 30 [2024-11-08 23:26:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129351795] [2024-11-08 23:26:04,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:26:04,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-08 23:26:04,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:26:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-08 23:26:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2024-11-08 23:26:04,071 INFO L87 Difference]: Start difference. First operand 555 states and 782 transitions. Second operand has 30 states, 29 states have (on average 4.103448275862069) internal successors, (119), 28 states have internal predecessors, (119), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) [2024-11-08 23:26:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:05,517 INFO L93 Difference]: Finished difference Result 1385 states and 1925 transitions. [2024-11-08 23:26:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-08 23:26:05,518 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.103448275862069) internal successors, (119), 28 states have internal predecessors, (119), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) Word has length 157 [2024-11-08 23:26:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:05,523 INFO L225 Difference]: With dead ends: 1385 [2024-11-08 23:26:05,524 INFO L226 Difference]: Without dead ends: 889 [2024-11-08 23:26:05,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=818, Invalid=2152, Unknown=0, NotChecked=0, Total=2970 [2024-11-08 23:26:05,527 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 556 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:05,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 956 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 23:26:05,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-08 23:26:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 567. [2024-11-08 23:26:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 421 states have (on average 1.2636579572446556) internal successors, (532), 423 states have internal predecessors, (532), 129 states have call successors, (129), 16 states have call predecessors, (129), 16 states have return successors, (129), 127 states have call predecessors, (129), 129 states have call successors, (129) [2024-11-08 23:26:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 790 transitions. [2024-11-08 23:26:05,631 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 790 transitions. Word has length 157 [2024-11-08 23:26:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:05,632 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 790 transitions. [2024-11-08 23:26:05,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.103448275862069) internal successors, (119), 28 states have internal predecessors, (119), 10 states have call successors, (69), 5 states have call predecessors, (69), 10 states have return successors, (69), 10 states have call predecessors, (69), 10 states have call successors, (69) [2024-11-08 23:26:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 790 transitions. [2024-11-08 23:26:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:26:05,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:05,634 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:05,653 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-08 23:26:05,835 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,SelfDestructingSolverStorable8 [2024-11-08 23:26:05,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:05,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -2012569752, now seen corresponding path program 1 times [2024-11-08 23:26:05,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:05,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670116906] [2024-11-08 23:26:05,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:26:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:26:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:26:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 23:26:06,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 23:26:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 23:26:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 23:26:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 23:26:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 23:26:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 23:26:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:26:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:26:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 23:26:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 23:26:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 23:26:06,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 23:26:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 23:26:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 23:26:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 23:26:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 23:26:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 23:26:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 23:26:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 23:26:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:26:06,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:26:06,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670116906] [2024-11-08 23:26:06,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670116906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:26:06,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586608476] [2024-11-08 23:26:06,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:06,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:26:06,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:26:06,257 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-08 23:26:06,258 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-08 23:26:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:06,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 23:26:06,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-08 23:26:06,860 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:26:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:26:07,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586608476] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:26:07,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:26:07,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 19 [2024-11-08 23:26:07,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629757074] [2024-11-08 23:26:07,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:26:07,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 23:26:07,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:26:07,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 23:26:07,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-08 23:26:07,128 INFO L87 Difference]: Start difference. First operand 567 states and 790 transitions. Second operand has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-08 23:26:08,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:08,011 INFO L93 Difference]: Finished difference Result 1312 states and 1803 transitions. [2024-11-08 23:26:08,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 23:26:08,012 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) Word has length 158 [2024-11-08 23:26:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:08,016 INFO L225 Difference]: With dead ends: 1312 [2024-11-08 23:26:08,016 INFO L226 Difference]: Without dead ends: 816 [2024-11-08 23:26:08,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2024-11-08 23:26:08,019 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 776 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:08,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 819 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 23:26:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2024-11-08 23:26:08,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 667. [2024-11-08 23:26:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 494 states have (on average 1.222672064777328) internal successors, (604), 500 states have internal predecessors, (604), 149 states have call successors, (149), 23 states have call predecessors, (149), 23 states have return successors, (149), 143 states have call predecessors, (149), 149 states have call successors, (149) [2024-11-08 23:26:08,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 902 transitions. [2024-11-08 23:26:08,118 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 902 transitions. Word has length 158 [2024-11-08 23:26:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:08,118 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 902 transitions. [2024-11-08 23:26:08,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.611111111111111) internal successors, (101), 19 states have internal predecessors, (101), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 5 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-08 23:26:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 902 transitions. [2024-11-08 23:26:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-08 23:26:08,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:08,120 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:08,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:26:08,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:26:08,322 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:08,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:08,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1464749094, now seen corresponding path program 1 times [2024-11-08 23:26:08,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:26:08,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069171834] [2024-11-08 23:26:08,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:08,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:26:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:26:08,427 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:26:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:26:08,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:26:08,601 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:26:08,602 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:26:08,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 23:26:08,606 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:26:08,728 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:26:08,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:26:08 BoogieIcfgContainer [2024-11-08 23:26:08,732 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:26:08,732 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:26:08,732 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:26:08,732 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:26:08,733 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:25:55" (3/4) ... [2024-11-08 23:26:08,735 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:26:08,736 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:26:08,737 INFO L158 Benchmark]: Toolchain (without parser) took 14793.61ms. Allocated memory was 153.1MB in the beginning and 343.9MB in the end (delta: 190.8MB). Free memory was 82.3MB in the beginning and 186.6MB in the end (delta: -104.3MB). Peak memory consumption was 88.1MB. Max. memory is 16.1GB. [2024-11-08 23:26:08,738 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:26:08,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.70ms. Allocated memory is still 153.1MB. Free memory was 82.3MB in the beginning and 64.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 23:26:08,738 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.83ms. Allocated memory is still 153.1MB. Free memory was 63.7MB in the beginning and 57.7MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:26:08,738 INFO L158 Benchmark]: Boogie Preprocessor took 112.12ms. Allocated memory is still 153.1MB. Free memory was 123.9MB in the beginning and 112.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:26:08,739 INFO L158 Benchmark]: RCFGBuilder took 632.11ms. Allocated memory is still 153.1MB. Free memory was 112.7MB in the beginning and 80.6MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 23:26:08,739 INFO L158 Benchmark]: TraceAbstraction took 13576.52ms. Allocated memory was 153.1MB in the beginning and 343.9MB in the end (delta: 190.8MB). Free memory was 79.9MB in the beginning and 186.6MB in the end (delta: -106.7MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-11-08 23:26:08,739 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 343.9MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:26:08,741 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.17ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.70ms. Allocated memory is still 153.1MB. Free memory was 82.3MB in the beginning and 64.0MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.83ms. Allocated memory is still 153.1MB. Free memory was 63.7MB in the beginning and 57.7MB in the end (delta: 6.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.12ms. Allocated memory is still 153.1MB. Free memory was 123.9MB in the beginning and 112.7MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 632.11ms. Allocated memory is still 153.1MB. Free memory was 112.7MB in the beginning and 80.6MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13576.52ms. Allocated memory was 153.1MB in the beginning and 343.9MB in the end (delta: 190.8MB). Free memory was 79.9MB in the beginning and 186.6MB in the end (delta: -106.7MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 343.9MB. Free memory is still 186.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of bitwiseOr at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] unsigned char var_1_4 = 1; [L24] double var_1_7 = 31.25; [L25] double var_1_8 = 7.6; [L26] double var_1_9 = 8.9; [L27] double var_1_10 = 256.8; [L28] signed short int var_1_11 = 0; [L29] unsigned long int var_1_15 = 64; [L30] signed short int var_1_18 = 16; [L31] signed short int var_1_19 = 22006; [L32] unsigned char var_1_21 = 1; [L33] unsigned char var_1_22 = 0; [L34] float var_1_23 = 2.25; [L35] signed long int var_1_24 = -1; [L36] unsigned char var_1_26 = 32; [L37] unsigned char var_1_27 = 200; [L38] unsigned char var_1_28 = 5; [L39] unsigned char var_1_29 = 64; [L40] unsigned char var_1_30 = 64; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 5; [L43] signed char var_1_33 = 2; [L44] signed char var_1_34 = 32; [L45] unsigned short int var_1_35 = 16; [L46] float var_1_37 = 63.5; [L47] signed long int last_1_var_1_24 = -1; [L48] unsigned char last_1_var_1_26 = 32; [L49] signed char last_1_var_1_33 = 2; [L50] unsigned short int last_1_var_1_35 = 16; VAL [isInitial=0, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L191] isInitial = 1 [L192] FCALL initially() [L193] int k_loop; [L194] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L194] COND TRUE k_loop < 1 [L195] CALL updateLastVariables() [L181] last_1_var_1_24 = var_1_24 [L182] last_1_var_1_26 = var_1_26 [L183] last_1_var_1_33 = var_1_33 [L184] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L144] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L145] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=38/5, var_1_9=89/10] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L147] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_9=89/10] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L149] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=1284/5, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L150] var_1_10 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L151] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=22006, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L152] var_1_19 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_19 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L153] RET assume_abort_if_not(var_1_19 >= 16383) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] CALL assume_abort_if_not(var_1_19 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L154] RET assume_abort_if_not(var_1_19 <= 32766) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=0, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L155] var_1_22 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L156] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L157] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=200, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L158] var_1_27 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_27 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L159] RET assume_abort_if_not(var_1_27 >= 190) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L160] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=5, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L161] var_1_28 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L162] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L163] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=64, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L164] var_1_29 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_29 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L165] RET assume_abort_if_not(var_1_29 >= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L166] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=64, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L167] var_1_30 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_30 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L168] RET assume_abort_if_not(var_1_30 >= 31) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] CALL assume_abort_if_not(var_1_30 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L169] RET assume_abort_if_not(var_1_30 <= 64) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=32, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L171] RET assume_abort_if_not(var_1_31 >= 32) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L172] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=5, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L175] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=32, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L176] var_1_34 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L177] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L178] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L196] RET updateVariables() [L197] CALL step() [L54] signed long int stepLocal_6 = last_1_var_1_24; [L55] unsigned char stepLocal_5 = var_1_30; [L56] signed long int stepLocal_4 = last_1_var_1_24; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=-225, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] EXPR last_1_var_1_35 | 100000000 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, stepLocal_5=-225, stepLocal_6=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L57] COND TRUE stepLocal_6 < (last_1_var_1_35 | 100000000) [L58] COND TRUE stepLocal_5 > last_1_var_1_35 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_4=-1, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=16, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L59] COND FALSE !(var_1_19 < stepLocal_4) [L62] var_1_35 = (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33)))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=1, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=62, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L74] COND TRUE \read(var_1_4) [L75] var_1_21 = (! var_1_22) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=9/4, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=62, var_1_37=127/2, var_1_4=1, var_1_7=125/4] [L77] COND TRUE ! var_1_21 [L78] var_1_23 = var_1_8 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=32, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=62, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L80] COND TRUE (var_1_8 + 199.375) <= 10.5 [L81] var_1_26 = ((var_1_27 - var_1_28) - (var_1_29 - 1)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=2, var_1_34=0, var_1_35=62, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L89] COND TRUE \read(var_1_22) [L90] var_1_33 = ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=127/2, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L92] var_1_37 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=0, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L93] COND FALSE !((- var_1_8) != var_1_23) [L96] var_1_11 = ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=64, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L98] COND TRUE var_1_26 == var_1_11 [L99] var_1_15 = ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L107] COND FALSE !((var_1_11 == var_1_15) && var_1_21) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L110] signed short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_3=130, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=16, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L111] COND TRUE var_1_1 != stepLocal_3 [L112] var_1_18 = (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=-32628, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=-1, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L114] COND FALSE !(var_1_18 != var_1_18) [L123] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=-32628, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=130, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L125] signed short int stepLocal_2 = var_1_11; [L126] signed long int stepLocal_1 = var_1_1; [L127] unsigned short int stepLocal_0 = var_1_35; VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_0=62, stepLocal_1=-256, stepLocal_2=130, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=-32628, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=130, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=125/4, var_1_8=100000005] [L128] COND FALSE !(stepLocal_0 == var_1_1) [L139] var_1_7 = var_1_10 VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, stepLocal_1=-256, stepLocal_2=130, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=-32628, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=130, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] [L197] RET step() [L198] CALL, EXPR property() [L187] EXPR ((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28)))) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=-32628, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=130, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] [L187-L188] return (((((((((((((var_1_11 == var_1_15) && var_1_21) ? (var_1_1 == ((signed long int) ((((var_1_33) < (var_1_33)) ? (var_1_33) : (var_1_33))))) : 1) && ((var_1_35 == var_1_1) ? ((var_1_11 < var_1_1) ? (var_1_7 == ((double) ((var_1_8 - var_1_9) + var_1_10))) : ((var_1_1 >= 25) ? (var_1_7 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_7 == ((double) var_1_10)))) : (var_1_7 == ((double) var_1_10)))) && (((- var_1_8) != var_1_23) ? (var_1_11 == ((signed short int) (500 + var_1_26))) : (var_1_11 == ((signed short int) ((((var_1_26) < ((var_1_26 + var_1_26))) ? (var_1_26) : ((var_1_26 + var_1_26)))))))) && ((var_1_26 == var_1_11) ? (var_1_15 == ((unsigned long int) ((((var_1_26) > (var_1_35)) ? (var_1_26) : (var_1_35))))) : ((var_1_9 < var_1_37) ? (var_1_15 == ((unsigned long int) var_1_35)) : (var_1_15 == ((unsigned long int) var_1_35))))) && ((var_1_1 != var_1_11) ? (var_1_18 == ((signed short int) (8 - ((((10) > ((var_1_19 - var_1_26))) ? (10) : ((var_1_19 - var_1_26))))))) : 1)) && (var_1_4 ? (var_1_21 == ((unsigned char) (! var_1_22))) : 1)) && ((! var_1_21) ? (var_1_23 == ((float) var_1_8)) : 1)) && ((var_1_18 != var_1_18) ? (((1u ^ var_1_19) > (- var_1_35)) ? (var_1_24 == ((signed long int) var_1_26)) : (var_1_22 ? (var_1_24 == ((signed long int) last_1_var_1_24)) : 1)) : (var_1_24 == ((signed long int) var_1_26)))) && (((var_1_8 + 199.375) <= 10.5) ? (var_1_26 == ((unsigned char) ((var_1_27 - var_1_28) - (var_1_29 - 1)))) : (var_1_21 ? (var_1_26 == ((unsigned char) ((var_1_29 - var_1_28) + ((var_1_30 + var_1_31) - var_1_32)))) : (var_1_26 == ((unsigned char) var_1_28))))) && (var_1_22 ? (var_1_33 == ((signed char) ((var_1_28 - var_1_32) + (var_1_31 - var_1_34)))) : 1)) && ((last_1_var_1_24 < (last_1_var_1_35 | 100000000)) ? ((var_1_30 > last_1_var_1_35) ? ((var_1_19 < last_1_var_1_24) ? (var_1_35 == ((unsigned short int) ((var_1_29 + var_1_28) + var_1_31))) : (var_1_35 == ((unsigned short int) (((((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) > (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))) ? ((var_1_34 + ((((var_1_28) > (32)) ? (var_1_28) : (32))))) : (((((last_1_var_1_33) < 0 ) ? -(last_1_var_1_33) : (last_1_var_1_33))))))))) : (var_1_35 == ((unsigned short int) ((((var_1_32) > (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))) ? (var_1_32) : (((((var_1_31) > (var_1_28)) ? (var_1_31) : (var_1_28))))))))) : ((var_1_8 != var_1_10) ? (var_1_35 == ((unsigned short int) ((((last_1_var_1_33) > (last_1_var_1_26)) ? (last_1_var_1_33) : (last_1_var_1_26))))) : (var_1_35 == ((unsigned short int) var_1_28))))) && (var_1_37 == ((float) var_1_10)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=-32628, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=130, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=-1, last_1_var_1_26=32, last_1_var_1_33=2, last_1_var_1_35=16, var_1_10=100000006, var_1_11=130, var_1_15=130, var_1_18=-32628, var_1_19=32766, var_1_1=-256, var_1_21=0, var_1_22=1, var_1_23=100000005, var_1_24=130, var_1_26=130, var_1_27=-12565506, var_1_28=-194, var_1_29=49471, var_1_30=-225, var_1_31=-15810, var_1_32=63, var_1_33=61, var_1_34=0, var_1_35=62, var_1_37=100000006, var_1_4=1, var_1_7=100000006, var_1_8=100000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 11, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2263 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2255 mSDsluCounter, 4477 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3071 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2040 IncrementalHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 1406 mSDtfsCounter, 2040 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1533 GetRequests, 1415 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=667occurred in iteration=10, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 862 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2193 NumberOfCodeBlocks, 2193 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2491 ConstructedInterpolants, 0 QuantifiedInterpolants, 7716 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1158 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 15772/16192 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-08 23:26:08,784 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.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 c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:26:11,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:26:11,212 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:26:11,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:26:11,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:26:11,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:26:11,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:26:11,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:26:11,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:26:11,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:26:11,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:26:11,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:26:11,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:26:11,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:26:11,268 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:26:11,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:26:11,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:26:11,271 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:26:11,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:26:11,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:26:11,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:26:11,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:26:11,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:26:11,275 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:26:11,275 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:26:11,276 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:26:11,276 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:26:11,276 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:26:11,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:26:11,277 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:26:11,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:26:11,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:26:11,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:26:11,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:26:11,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:26:11,278 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:26:11,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:26:11,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:26:11,281 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:26:11,281 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:26:11,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:26:11,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:26:11,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:26:11,282 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:26:11,282 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 -> c6a1e4d16783083322ed1380945f24b1c45927b1b42eff5afeb8e1e1de765cf0 [2024-11-08 23:26:11,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:26:11,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:26:11,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:26:11,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:26:11,669 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:26:11,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2024-11-08 23:26:13,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:26:13,392 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:26:13,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-93.i [2024-11-08 23:26:13,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b19f63f7/250acdb67f434dc98f3c3e1464a0906b/FLAGb0703136e [2024-11-08 23:26:13,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b19f63f7/250acdb67f434dc98f3c3e1464a0906b [2024-11-08 23:26:13,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:26:13,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:26:13,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:26:13,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:26:13,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:26:13,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c999629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13, skipping insertion in model container [2024-11-08 23:26:13,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:26:13,667 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-1loop_file-93.i[916,929] [2024-11-08 23:26:13,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:26:13,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:26:13,794 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-1loop_file-93.i[916,929] [2024-11-08 23:26:13,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:26:13,871 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:26:13,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13 WrapperNode [2024-11-08 23:26:13,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:26:13,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:26:13,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:26:13,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:26:13,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,942 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-08 23:26:13,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:26:13,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:26:13,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:26:13,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:26:13,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,983 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-08 23:26:13,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:13,996 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:14,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:14,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:14,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:14,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:26:14,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:26:14,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:26:14,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:26:14,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (1/1) ... [2024-11-08 23:26:14,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:26:14,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:26:14,067 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-08 23:26:14,069 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-08 23:26:14,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:26:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:26:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:26:14,106 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:26:14,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:26:14,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:26:14,191 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:26:14,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:26:20,192 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-08 23:26:20,192 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:26:20,209 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:26:20,210 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:26:20,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:20 BoogieIcfgContainer [2024-11-08 23:26:20,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:26:20,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:26:20,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:26:20,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:26:20,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:26:13" (1/3) ... [2024-11-08 23:26:20,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0db898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:20, skipping insertion in model container [2024-11-08 23:26:20,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:26:13" (2/3) ... [2024-11-08 23:26:20,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0db898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:26:20, skipping insertion in model container [2024-11-08 23:26:20,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:26:20" (3/3) ... [2024-11-08 23:26:20,222 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-93.i [2024-11-08 23:26:20,240 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:26:20,240 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:26:20,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:26:20,314 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;@4f800860, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:26:20,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:26:20,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:26:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:20,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:20,331 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:20,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:20,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1838406269, now seen corresponding path program 1 times [2024-11-08 23:26:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:20,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664038291] [2024-11-08 23:26:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:20,348 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-08 23:26:20,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:20,351 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-08 23:26:20,353 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-08 23:26:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:20,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:26:20,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:20,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-11-08 23:26:20,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:26:20,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:26:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664038291] [2024-11-08 23:26:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664038291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:20,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:20,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:26:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692373394] [2024-11-08 23:26:20,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:20,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:26:20,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:26:20,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:26:20,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:26:20,840 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:26:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:20,871 INFO L93 Difference]: Finished difference Result 153 states and 264 transitions. [2024-11-08 23:26:20,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:26:20,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-08 23:26:20,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:20,882 INFO L225 Difference]: With dead ends: 153 [2024-11-08 23:26:20,883 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 23:26:20,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-08 23:26:20,893 INFO L432 NwaCegarLoop]: 116 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, 116 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-08 23:26:20,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:26:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 23:26:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 23:26:20,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-08 23:26:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-08 23:26:20,939 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2024-11-08 23:26:20,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:20,939 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-08 23:26:20,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-08 23:26:20,940 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-08 23:26:20,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:20,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:20,943 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:20,954 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 (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:26:21,143 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-08 23:26:21,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1130403401, now seen corresponding path program 1 times [2024-11-08 23:26:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281387793] [2024-11-08 23:26:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:21,146 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-08 23:26:21,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:21,148 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-08 23:26:21,149 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-08 23:26:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:21,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 23:26:21,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:26:22,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:26:22,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:26:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281387793] [2024-11-08 23:26:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281387793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:26:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670685860] [2024-11-08 23:26:22,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:22,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 23:26:22,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:26:22,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 23:26:22,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:26:22,573 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:26,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:30,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:34,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:34,851 INFO L93 Difference]: Finished difference Result 213 states and 329 transitions. [2024-11-08 23:26:34,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 23:26:34,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-08 23:26:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:34,887 INFO L225 Difference]: With dead ends: 213 [2024-11-08 23:26:34,887 INFO L226 Difference]: Without dead ends: 143 [2024-11-08 23:26:34,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 23:26:34,889 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 90 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:34,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 427 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 13 Invalid, 2 Unknown, 0 Unchecked, 12.2s Time] [2024-11-08 23:26:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-08 23:26:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 116. [2024-11-08 23:26:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:26:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 177 transitions. [2024-11-08 23:26:34,927 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 177 transitions. Word has length 152 [2024-11-08 23:26:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:34,928 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 177 transitions. [2024-11-08 23:26:34,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 177 transitions. [2024-11-08 23:26:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:34,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:34,931 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:34,948 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 (3)] Ended with exit code 0 [2024-11-08 23:26:35,131 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-08 23:26:35,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:35,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:35,135 INFO L85 PathProgramCache]: Analyzing trace with hash -505232273, now seen corresponding path program 1 times [2024-11-08 23:26:35,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:35,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035959043] [2024-11-08 23:26:35,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:35,136 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-08 23:26:35,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:35,139 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-08 23:26:35,140 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-08 23:26:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:35,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:26:35,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-08 23:26:35,572 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:26:35,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:26:35,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035959043] [2024-11-08 23:26:35,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035959043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:26:35,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:26:35,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:26:35,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958431318] [2024-11-08 23:26:35,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:26:35,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:26:35,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:26:35,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:26:35,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:26:35,578 INFO L87 Difference]: Start difference. First operand 116 states and 177 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:40,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:43,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:43,647 INFO L93 Difference]: Finished difference Result 253 states and 390 transitions. [2024-11-08 23:26:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:26:43,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-08 23:26:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:43,651 INFO L225 Difference]: With dead ends: 253 [2024-11-08 23:26:43,652 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 23:26:43,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-08 23:26:43,655 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 100 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:43,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 299 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 8.0s Time] [2024-11-08 23:26:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 23:26:43,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 117. [2024-11-08 23:26:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 23:26:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 178 transitions. [2024-11-08 23:26:43,688 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 178 transitions. Word has length 152 [2024-11-08 23:26:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:43,691 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 178 transitions. [2024-11-08 23:26:43,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-08 23:26:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 178 transitions. [2024-11-08 23:26:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:43,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:43,698 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:43,713 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 (4)] Ended with exit code 0 [2024-11-08 23:26:43,898 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-08 23:26:43,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:43,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:43,900 INFO L85 PathProgramCache]: Analyzing trace with hash -247066835, now seen corresponding path program 1 times [2024-11-08 23:26:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:43,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404974015] [2024-11-08 23:26:43,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:43,901 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-08 23:26:43,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:43,904 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-08 23:26:43,907 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-08 23:26:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:44,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 23:26:44,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:26:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-08 23:26:45,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:26:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-08 23:26:46,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:26:46,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404974015] [2024-11-08 23:26:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404974015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:26:46,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:26:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 23:26:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212167768] [2024-11-08 23:26:46,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:26:46,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 23:26:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:26:46,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 23:26:46,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 23:26:46,328 INFO L87 Difference]: Start difference. First operand 117 states and 178 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 23:26:51,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:53,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:26:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:26:54,002 INFO L93 Difference]: Finished difference Result 279 states and 415 transitions. [2024-11-08 23:26:54,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 23:26:54,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 152 [2024-11-08 23:26:54,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:26:54,006 INFO L225 Difference]: With dead ends: 279 [2024-11-08 23:26:54,006 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 23:26:54,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-08 23:26:54,011 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 331 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 121 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:26:54,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 364 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 293 Invalid, 1 Unknown, 0 Unchecked, 7.3s Time] [2024-11-08 23:26:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 23:26:54,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2024-11-08 23:26:54,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 122 states have (on average 1.2540983606557377) internal successors, (153), 122 states have internal predecessors, (153), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-08 23:26:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 291 transitions. [2024-11-08 23:26:54,063 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 291 transitions. Word has length 152 [2024-11-08 23:26:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:26:54,064 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 291 transitions. [2024-11-08 23:26:54,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 23:26:54,065 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 291 transitions. [2024-11-08 23:26:54,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 23:26:54,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:26:54,068 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:26:54,084 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 (5)] Ended with exit code 0 [2024-11-08 23:26:54,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-08 23:26:54,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:26:54,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:26:54,270 INFO L85 PathProgramCache]: Analyzing trace with hash -640093845, now seen corresponding path program 1 times [2024-11-08 23:26:54,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:26:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408644155] [2024-11-08 23:26:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:26:54,271 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-08 23:26:54,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:26:54,272 INFO L229 MonitoredProcess]: Starting monitored process 6 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-08 23:26:54,274 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 (6)] Waiting until timeout for monitored process [2024-11-08 23:26:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:26:54,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 23:26:54,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:27:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-08 23:27:02,827 INFO L311 TraceCheckSpWp]: Computing backward predicates...