./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.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 f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:22:18,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:22:19,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:22:19,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:22:19,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:22:19,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:22:19,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:22:19,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:22:19,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:22:19,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:22:19,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:22:19,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:22:19,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:22:19,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:22:19,055 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:22:19,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:22:19,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:22:19,058 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:22:19,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:22:19,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:22:19,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:22:19,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:22:19,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:22:19,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:22:19,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:22:19,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:22:19,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:22:19,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:22:19,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:22:19,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:22:19,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:22:19,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:22:19,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:22:19,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:22:19,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:22:19,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:22:19,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:22:19,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:22:19,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:22:19,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:22:19,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:22:19,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:22:19,064 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 -> f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 [2024-10-24 08:22:19,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:22:19,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:22:19,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:22:19,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:22:19,293 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:22:19,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-24 08:22:20,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:22:20,647 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:22:20,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-24 08:22:20,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f9c1ab1/df06fa5babc14f098f263ab7ced9ac4d/FLAGfb3300163 [2024-10-24 08:22:20,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f9c1ab1/df06fa5babc14f098f263ab7ced9ac4d [2024-10-24 08:22:20,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:22:20,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:22:20,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:22:20,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:22:20,676 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:22:20,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:20,677 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9db325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20, skipping insertion in model container [2024-10-24 08:22:20,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:20,707 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:22:20,833 WARN L248 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_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-10-24 08:22:20,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:22:20,886 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:22:20,894 WARN L248 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_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-10-24 08:22:20,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:22:20,934 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:22:20,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20 WrapperNode [2024-10-24 08:22:20,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:22:20,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:22:20,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:22:20,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:22:20,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:20,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,003 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-10-24 08:22:21,004 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:22:21,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:22:21,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:22:21,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:22:21,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,041 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-10-24 08:22:21,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:22:21,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:22:21,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:22:21,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:22:21,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (1/1) ... [2024-10-24 08:22:21,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:22:21,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:22:21,102 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-10-24 08:22:21,104 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-10-24 08:22:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:22:21,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:22:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:22:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:22:21,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:22:21,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:22:21,223 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:22:21,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:22:21,548 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 08:22:21,549 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:22:21,582 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:22:21,583 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:22:21,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:22:21 BoogieIcfgContainer [2024-10-24 08:22:21,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:22:21,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:22:21,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:22:21,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:22:21,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:22:20" (1/3) ... [2024-10-24 08:22:21,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7737d684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:22:21, skipping insertion in model container [2024-10-24 08:22:21,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:20" (2/3) ... [2024-10-24 08:22:21,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7737d684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:22:21, skipping insertion in model container [2024-10-24 08:22:21,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:22:21" (3/3) ... [2024-10-24 08:22:21,591 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-24 08:22:21,603 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:22:21,603 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:22:21,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:22:21,659 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;@6df55d1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:22:21,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:22:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 08:22:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 08:22:21,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:21,677 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:21,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:21,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:21,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1696566966, now seen corresponding path program 1 times [2024-10-24 08:22:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309370844] [2024-10-24 08:22:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:21,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:22:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:22:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:22:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:22:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:22:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:22:21,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:22:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:22:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:22:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:22:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:22:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:22:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:22:22,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:22:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:22:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:22:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:22:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:22:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:22:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:22:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:22:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:22:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:22:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:22:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:22:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:22:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:22:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:22:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 08:22:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309370844] [2024-10-24 08:22:22,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309370844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:22,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:22,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:22:22,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645129962] [2024-10-24 08:22:22,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:22,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:22:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:22,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:22:22,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:22:22,087 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:22,154 INFO L93 Difference]: Finished difference Result 165 states and 299 transitions. [2024-10-24 08:22:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:22:22,156 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-24 08:22:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:22,164 INFO L225 Difference]: With dead ends: 165 [2024-10-24 08:22:22,165 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 08:22:22,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-10-24 08:22:22,188 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:22,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:22:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 08:22:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 08:22:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 08:22:22,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-24 08:22:22,237 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 187 [2024-10-24 08:22:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:22,238 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-24 08:22:22,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:22,238 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-24 08:22:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 08:22:22,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:22,242 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:22,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:22:22,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:22,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash 742667134, now seen corresponding path program 1 times [2024-10-24 08:22:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:22,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132302209] [2024-10-24 08:22:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:22:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:22:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:22:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:22:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:22:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:22:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:22:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:22:22,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:22:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:22:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:22:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:22:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:22:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:22:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:22:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:22:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:22:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:22:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:22:22,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:22:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:22:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:22:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:22:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:22:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:22:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:22:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:22:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:22:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 08:22:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:22,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132302209] [2024-10-24 08:22:22,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132302209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:22,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:22,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:22:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140240255] [2024-10-24 08:22:22,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:22,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:22:22,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:22,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:22:22,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:22:22,461 INFO L87 Difference]: Start difference. First operand 82 states and 129 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:22,512 INFO L93 Difference]: Finished difference Result 212 states and 332 transitions. [2024-10-24 08:22:22,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:22:22,513 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-24 08:22:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:22,515 INFO L225 Difference]: With dead ends: 212 [2024-10-24 08:22:22,515 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 08:22:22,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:22:22,520 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 73 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:22,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 277 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:22:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 08:22:22,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2024-10-24 08:22:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-24 08:22:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2024-10-24 08:22:22,544 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 187 [2024-10-24 08:22:22,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:22,545 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2024-10-24 08:22:22,545 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:22,546 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2024-10-24 08:22:22,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 08:22:22,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:22,551 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:22,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:22:22,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:22,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:22,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1251477572, now seen corresponding path program 1 times [2024-10-24 08:22:22,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:22,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794752962] [2024-10-24 08:22:22,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:22,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:22:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:22:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:22:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:22:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:22:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:22:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:22:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:22:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:22:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:22:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:22:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:22:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:22:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:22:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:22:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:22:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:22:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:22:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:22:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:22:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:22:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:22:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:22:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:22:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:22:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:22:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:22:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:22:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 08:22:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:22,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:22,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794752962] [2024-10-24 08:22:22,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794752962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:22,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:22:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332542541] [2024-10-24 08:22:22,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:22,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:22:22,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:22,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:22:22,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:22:22,926 INFO L87 Difference]: Start difference. First operand 128 states and 201 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:23,080 INFO L93 Difference]: Finished difference Result 361 states and 569 transitions. [2024-10-24 08:22:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:22:23,081 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-24 08:22:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:23,084 INFO L225 Difference]: With dead ends: 361 [2024-10-24 08:22:23,085 INFO L226 Difference]: Without dead ends: 234 [2024-10-24 08:22:23,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-10-24 08:22:23,086 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 101 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:23,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 369 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:22:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-24 08:22:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2024-10-24 08:22:23,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 123 states have internal predecessors, (167), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 08:22:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 307 transitions. [2024-10-24 08:22:23,106 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 307 transitions. Word has length 187 [2024-10-24 08:22:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:23,107 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 307 transitions. [2024-10-24 08:22:23,107 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:23,110 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 307 transitions. [2024-10-24 08:22:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:23,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:23,112 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:22:23,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:23,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:23,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1525232206, now seen corresponding path program 1 times [2024-10-24 08:22:23,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:23,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910351471] [2024-10-24 08:22:23,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:23,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:22:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:22:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:22:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:22:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:22:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:22:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:22:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:22:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:22:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:22:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:22:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:22:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:22:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:22:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:22:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:22:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:22:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:22:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:22:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:22:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:22:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:22:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:22:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:22:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:22:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:22:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:22:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:22:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 08:22:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910351471] [2024-10-24 08:22:23,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910351471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:23,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:23,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:22:23,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026120487] [2024-10-24 08:22:23,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:23,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:22:23,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:23,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:22:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:22:23,479 INFO L87 Difference]: Start difference. First operand 196 states and 307 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:23,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:23,783 INFO L93 Difference]: Finished difference Result 534 states and 838 transitions. [2024-10-24 08:22:23,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:22:23,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-24 08:22:23,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:23,788 INFO L225 Difference]: With dead ends: 534 [2024-10-24 08:22:23,788 INFO L226 Difference]: Without dead ends: 407 [2024-10-24 08:22:23,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:22:23,790 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 158 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:23,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 452 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:22:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-24 08:22:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 321. [2024-10-24 08:22:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 204 states have (on average 1.3823529411764706) internal successors, (282), 206 states have internal predecessors, (282), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-24 08:22:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 504 transitions. [2024-10-24 08:22:23,846 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 504 transitions. Word has length 188 [2024-10-24 08:22:23,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:23,847 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 504 transitions. [2024-10-24 08:22:23,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 504 transitions. [2024-10-24 08:22:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:23,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:23,849 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:23,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:22:23,850 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:23,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:23,850 INFO L85 PathProgramCache]: Analyzing trace with hash 514114956, now seen corresponding path program 1 times [2024-10-24 08:22:23,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:23,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375089455] [2024-10-24 08:22:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:23,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:22:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:22:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:22:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:22:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:22:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:22:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:22:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:22:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:22:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:22:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:22:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:23,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:22:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:22:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:22:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:22:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:22:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:22:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:22:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:22:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:22:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:22:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:22:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:22:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:22:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:22:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:22:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:22:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:22:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 08:22:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:24,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:24,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375089455] [2024-10-24 08:22:24,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375089455] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:24,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:24,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:22:24,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946465093] [2024-10-24 08:22:24,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:24,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:22:24,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:24,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:22:24,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:22:24,030 INFO L87 Difference]: Start difference. First operand 321 states and 504 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:24,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:24,088 INFO L93 Difference]: Finished difference Result 573 states and 901 transitions. [2024-10-24 08:22:24,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:22:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-24 08:22:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:24,094 INFO L225 Difference]: With dead ends: 573 [2024-10-24 08:22:24,095 INFO L226 Difference]: Without dead ends: 321 [2024-10-24 08:22:24,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 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-10-24 08:22:24,097 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:24,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:22:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-24 08:22:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-10-24 08:22:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 204 states have (on average 1.3627450980392157) internal successors, (278), 206 states have internal predecessors, (278), 111 states have call successors, (111), 5 states have call predecessors, (111), 5 states have return successors, (111), 109 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-24 08:22:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 500 transitions. [2024-10-24 08:22:24,135 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 500 transitions. Word has length 188 [2024-10-24 08:22:24,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:24,136 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 500 transitions. [2024-10-24 08:22:24,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:24,137 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 500 transitions. [2024-10-24 08:22:24,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:24,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:24,138 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:24,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:22:24,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:24,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:24,140 INFO L85 PathProgramCache]: Analyzing trace with hash -295231670, now seen corresponding path program 1 times [2024-10-24 08:22:24,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513174256] [2024-10-24 08:22:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:24,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:22:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:22:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:22:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:22:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:22:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:22:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:22:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:22:24,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:22:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:22:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:22:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:22:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:22:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:22:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:22:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:22:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:22:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:22:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:22:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:22:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:22:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:22:24,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:22:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:22:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:22:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:22:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:22:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:22:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 08:22:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-24 08:22:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513174256] [2024-10-24 08:22:24,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513174256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:22:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199763718] [2024-10-24 08:22:24,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:24,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:22:24,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:22:24,383 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-10-24 08:22:24,384 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-10-24 08:22:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:24,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:22:24,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-10-24 08:22:24,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-24 08:22:24,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199763718] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:22:24,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:22:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 08:22:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617631020] [2024-10-24 08:22:24,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:22:24,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:22:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:24,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:22:24,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:22:24,868 INFO L87 Difference]: Start difference. First operand 321 states and 500 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-24 08:22:25,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:25,032 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2024-10-24 08:22:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:22:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 188 [2024-10-24 08:22:25,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:25,034 INFO L225 Difference]: With dead ends: 499 [2024-10-24 08:22:25,034 INFO L226 Difference]: Without dead ends: 241 [2024-10-24 08:22:25,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 430 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:22:25,036 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 111 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:25,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 209 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:22:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-24 08:22:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2024-10-24 08:22:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 141 states have internal predecessors, (179), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 08:22:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 353 transitions. [2024-10-24 08:22:25,053 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 353 transitions. Word has length 188 [2024-10-24 08:22:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:25,054 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 353 transitions. [2024-10-24 08:22:25,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-24 08:22:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 353 transitions. [2024-10-24 08:22:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:25,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:25,055 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:25,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:22:25,259 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-10-24 08:22:25,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:25,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2083606774, now seen corresponding path program 1 times [2024-10-24 08:22:25,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:25,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818780085] [2024-10-24 08:22:25,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:25,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:22:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:22:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:22:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:22:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:22:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:22:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:22:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:22:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:22:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:22:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:22:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:22:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:22:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 08:22:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:22:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 08:22:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:22:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:22:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:22:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 08:22:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:22:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 08:22:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:22:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 08:22:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:22:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 08:22:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:22:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 08:22:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 08:22:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 111 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2024-10-24 08:22:25,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:25,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818780085] [2024-10-24 08:22:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818780085] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:22:25,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354138792] [2024-10-24 08:22:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:25,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:22:25,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:22:25,794 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-10-24 08:22:25,796 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-10-24 08:22:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:25,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 08:22:25,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-10-24 08:22:26,713 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:27,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-24 08:22:27,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354138792] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:22:27,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:22:27,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 23 [2024-10-24 08:22:27,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635522387] [2024-10-24 08:22:27,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:22:27,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 08:22:27,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:27,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 08:22:27,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2024-10-24 08:22:27,170 INFO L87 Difference]: Start difference. First operand 235 states and 353 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-10-24 08:22:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:29,199 INFO L93 Difference]: Finished difference Result 923 states and 1303 transitions. [2024-10-24 08:22:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2024-10-24 08:22:29,199 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) Word has length 188 [2024-10-24 08:22:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:29,205 INFO L225 Difference]: With dead ends: 923 [2024-10-24 08:22:29,205 INFO L226 Difference]: Without dead ends: 838 [2024-10-24 08:22:29,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3476 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1957, Invalid=8143, Unknown=0, NotChecked=0, Total=10100 [2024-10-24 08:22:29,209 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1044 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:29,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 1263 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 08:22:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-10-24 08:22:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 359. [2024-10-24 08:22:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 226 states have (on average 1.252212389380531) internal successors, (283), 226 states have internal predecessors, (283), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-24 08:22:29,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 515 transitions. [2024-10-24 08:22:29,246 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 515 transitions. Word has length 188 [2024-10-24 08:22:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:29,247 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 515 transitions. [2024-10-24 08:22:29,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 23 states have internal predecessors, (117), 6 states have call successors, (58), 4 states have call predecessors, (58), 9 states have return successors, (60), 6 states have call predecessors, (60), 6 states have call successors, (60) [2024-10-24 08:22:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 515 transitions. [2024-10-24 08:22:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:29,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:29,249 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:29,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 08:22:29,450 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,SelfDestructingSolverStorable6 [2024-10-24 08:22:29,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:29,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:29,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1624554508, now seen corresponding path program 1 times [2024-10-24 08:22:29,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:29,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505813547] [2024-10-24 08:22:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:22:29,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [216599708] [2024-10-24 08:22:29,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:29,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:22:29,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:22:29,504 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-10-24 08:22:29,505 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-10-24 08:22:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:29,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 08:22:29,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:30,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-24 08:22:30,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505813547] [2024-10-24 08:22:31,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 08:22:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216599708] [2024-10-24 08:22:31,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216599708] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:22:31,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 08:22:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-24 08:22:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962413052] [2024-10-24 08:22:31,413 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 08:22:31,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 08:22:31,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:31,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 08:22:31,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-24 08:22:31,415 INFO L87 Difference]: Start difference. First operand 359 states and 515 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:32,153 INFO L93 Difference]: Finished difference Result 1064 states and 1502 transitions. [2024-10-24 08:22:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 08:22:32,154 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-10-24 08:22:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:32,159 INFO L225 Difference]: With dead ends: 1064 [2024-10-24 08:22:32,159 INFO L226 Difference]: Without dead ends: 777 [2024-10-24 08:22:32,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-24 08:22:32,161 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 115 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 72 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:32,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 849 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 604 Invalid, 8 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:22:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2024-10-24 08:22:32,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 647. [2024-10-24 08:22:32,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 411 states have (on average 1.2262773722627738) internal successors, (504), 411 states have internal predecessors, (504), 203 states have call successors, (203), 32 states have call predecessors, (203), 32 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2024-10-24 08:22:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 910 transitions. [2024-10-24 08:22:32,220 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 910 transitions. Word has length 188 [2024-10-24 08:22:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:32,220 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 910 transitions. [2024-10-24 08:22:32,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 910 transitions. [2024-10-24 08:22:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:32,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:32,223 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:32,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 08:22:32,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:22:32,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:32,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:32,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1366389070, now seen corresponding path program 1 times [2024-10-24 08:22:32,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:32,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887600961] [2024-10-24 08:22:32,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:32,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:22:32,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1495735214] [2024-10-24 08:22:32,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:32,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:22:32,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:22:32,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:22:32,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 08:22:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:32,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 08:22:32,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-24 08:22:33,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:33,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:22:33,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887600961] [2024-10-24 08:22:33,554 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 08:22:33,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495735214] [2024-10-24 08:22:33,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495735214] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:22:33,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 08:22:33,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2024-10-24 08:22:33,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31204075] [2024-10-24 08:22:33,555 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 08:22:33,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:22:33,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:22:33,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:22:33,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=114, Unknown=2, NotChecked=0, Total=156 [2024-10-24 08:22:33,556 INFO L87 Difference]: Start difference. First operand 647 states and 910 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:34,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:34,180 INFO L93 Difference]: Finished difference Result 1162 states and 1614 transitions. [2024-10-24 08:22:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 08:22:34,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-10-24 08:22:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:34,185 INFO L225 Difference]: With dead ends: 1162 [2024-10-24 08:22:34,185 INFO L226 Difference]: Without dead ends: 979 [2024-10-24 08:22:34,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=387, Unknown=2, NotChecked=0, Total=552 [2024-10-24 08:22:34,186 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 149 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 77 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:34,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 666 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 497 Invalid, 8 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:22:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-24 08:22:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 875. [2024-10-24 08:22:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 565 states have (on average 1.2318584070796461) internal successors, (696), 567 states have internal predecessors, (696), 265 states have call successors, (265), 44 states have call predecessors, (265), 44 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2024-10-24 08:22:34,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1226 transitions. [2024-10-24 08:22:34,269 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1226 transitions. Word has length 188 [2024-10-24 08:22:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:34,269 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1226 transitions. [2024-10-24 08:22:34,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1226 transitions. [2024-10-24 08:22:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-24 08:22:34,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:34,271 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:34,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 08:22:34,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:22:34,476 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 11550151, now seen corresponding path program 1 times [2024-10-24 08:22:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:22:34,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373802396] [2024-10-24 08:22:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:22:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 08:22:34,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [978295096] [2024-10-24 08:22:34,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:34,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:22:34,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:22:34,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:22:34,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 08:22:34,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:22:34,647 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:22:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:22:34,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:22:34,769 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:22:34,770 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:22:34,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 08:22:34,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 08:22:34,978 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:22:35,078 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:22:35,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:22:35 BoogieIcfgContainer [2024-10-24 08:22:35,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:22:35,081 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:22:35,081 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:22:35,081 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:22:35,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:22:21" (3/4) ... [2024-10-24 08:22:35,083 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:22:35,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:22:35,084 INFO L158 Benchmark]: Toolchain (without parser) took 14416.73ms. Allocated memory was 146.8MB in the beginning and 419.4MB in the end (delta: 272.6MB). Free memory was 75.4MB in the beginning and 369.8MB in the end (delta: -294.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:22:35,084 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:22:35,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.16ms. Allocated memory is still 146.8MB. Free memory was 75.2MB in the beginning and 57.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 08:22:35,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.78ms. Allocated memory is still 146.8MB. Free memory was 57.7MB in the beginning and 114.6MB in the end (delta: -56.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-24 08:22:35,085 INFO L158 Benchmark]: Boogie Preprocessor took 63.99ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 114.6MB in the beginning and 161.2MB in the end (delta: -46.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-10-24 08:22:35,085 INFO L158 Benchmark]: RCFGBuilder took 514.15ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 127.7MB in the end (delta: 33.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 08:22:35,085 INFO L158 Benchmark]: TraceAbstraction took 13494.76ms. Allocated memory was 195.0MB in the beginning and 419.4MB in the end (delta: 224.4MB). Free memory was 127.7MB in the beginning and 370.8MB in the end (delta: -243.2MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. [2024-10-24 08:22:35,085 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 419.4MB. Free memory is still 369.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:22:35,086 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.14ms. Allocated memory is still 146.8MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.16ms. Allocated memory is still 146.8MB. Free memory was 75.2MB in the beginning and 57.8MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.78ms. Allocated memory is still 146.8MB. Free memory was 57.7MB in the beginning and 114.6MB in the end (delta: -56.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.99ms. Allocated memory was 146.8MB in the beginning and 195.0MB in the end (delta: 48.2MB). Free memory was 114.6MB in the beginning and 161.2MB in the end (delta: -46.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * RCFGBuilder took 514.15ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 127.7MB in the end (delta: 33.6MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13494.76ms. Allocated memory was 195.0MB in the beginning and 419.4MB in the end (delta: 224.4MB). Free memory was 127.7MB in the beginning and 370.8MB in the end (delta: -243.2MB). Peak memory consumption was 222.4MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 419.4MB. Free memory is still 369.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 65. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_25 = 1; [L38] float var_1_26 = 500.65; [L39] signed long int var_1_27 = -8; [L40] float var_1_28 = 255.5; [L41] float var_1_29 = 7.5; [L42] float var_1_30 = 9.8; [L43] unsigned char var_1_31 = 4; [L44] unsigned char var_1_33 = 2; [L45] unsigned short int var_1_34 = 1; [L46] unsigned long int var_1_35 = 10; [L47] unsigned char var_1_36 = 10; [L48] unsigned char var_1_37 = 128; [L49] unsigned char var_1_38 = 16; [L50] unsigned char var_1_39 = 0; [L51] unsigned short int var_1_40 = 10; [L52] unsigned short int var_1_41 = 128; [L53] unsigned short int var_1_42 = 40597; [L54] signed short int last_1_var_1_1 = 16; [L55] unsigned char last_1_var_1_6 = 10; [L56] unsigned char last_1_var_1_8 = 1; [L57] signed short int last_1_var_1_13 = 200; [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L194] last_1_var_1_1 = var_1_1 [L195] last_1_var_1_6 = var_1_6 [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_13 = var_1_13 [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_5 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L148] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L149] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L149] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=128, var_1_8=1] [L150] var_1_7 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L151] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L152] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L154] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L155] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L155] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L156] var_1_12 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L157] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L158] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L159] var_1_15 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L160] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L161] var_1_16 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L162] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L163] var_1_20 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L164] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L165] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L167] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L168] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L173] var_1_28 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L174] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L175] var_1_29 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L176] RET assume_abort_if_not((var_1_29 >= -461168.6018427382800e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=2, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L177] var_1_33 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L178] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L179] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=128, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L180] var_1_37 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_37 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L181] RET assume_abort_if_not(var_1_37 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_37 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L182] RET assume_abort_if_not(var_1_37 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=16, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L183] var_1_38 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L184] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_38 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L185] RET assume_abort_if_not(var_1_38 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L186] var_1_39 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L187] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L188] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L189] var_1_42 = __VERIFIER_nondet_ushort() [L190] CALL assume_abort_if_not(var_1_42 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L190] RET assume_abort_if_not(var_1_42 >= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L191] CALL assume_abort_if_not(var_1_42 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L191] RET assume_abort_if_not(var_1_42 <= 65534) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L208] RET updateVariables() [L209] CALL step() [L61] COND TRUE var_1_19 || var_1_8 [L62] var_1_21 = ((var_1_13 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_26=10013/20, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L64] COND TRUE ((var_1_13 + 25) % var_1_27) < 2 [L65] var_1_26 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) + var_1_29) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_30=49/5, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L67] COND TRUE (- var_1_28) < ((((var_1_14) > (var_1_29)) ? (var_1_14) : (var_1_29))) [L68] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=4, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L70] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_13)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_13))) <= var_1_13 [L71] var_1_31 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L73] COND FALSE !(var_1_6 < ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6)))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L76] COND TRUE \read(var_1_25) [L77] var_1_35 = var_1_33 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L79] COND TRUE \read(var_1_25) [L80] var_1_36 = (var_1_37 - var_1_38) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=10, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L84] COND TRUE (- var_1_17) != var_1_17 [L85] var_1_40 = var_1_39 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=128, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L87] COND FALSE !(var_1_33 <= (~ var_1_13)) [L92] var_1_41 = var_1_1 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L94] signed long int stepLocal_6 = last_1_var_1_1; [L95] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=0, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L96] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L97] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L100] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L105] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L108] COND FALSE !(var_1_5 >= -2) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L111] unsigned char stepLocal_4 = var_1_6; [L112] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L113] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=10, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L114] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L115] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L122] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L123] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L126] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L127] COND TRUE \read(var_1_19) [L128] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L134] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L135] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=1] [L136] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L143] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=10, stepLocal_1=201, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_25=1, var_1_27=-224, var_1_29=2, var_1_30=2, var_1_31=0, var_1_33=0, var_1_34=1, var_1_35=0, var_1_36=127, var_1_37=127, var_1_38=0, var_1_39=0, var_1_40=0, var_1_41=16, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=201, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 1794 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1751 mSDsluCounter, 4450 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3264 mSDsCounter, 933 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2523 IncrementalHoareTripleChecker+Invalid, 3472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 933 mSolverCounterUnsat, 1186 mSDtfsCounter, 2523 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2047 GetRequests, 1881 SyntacticMatches, 2 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3633 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=9, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 846 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2428 ConstructedInterpolants, 2 QuantifiedInterpolants, 10908 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1778 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 20476/21112 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-10-24 08:22:35,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.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 f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:22:36,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:22:36,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:22:36,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:22:36,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:22:36,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:22:36,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:22:36,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:22:36,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:22:36,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:22:36,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:22:36,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:22:36,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:22:36,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:22:36,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:22:36,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:22:36,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:22:36,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:22:36,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:22:36,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:22:36,951 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:22:36,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:22:36,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:22:36,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:22:36,954 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:22:36,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:22:36,955 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:22:36,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:22:36,955 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:22:36,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:22:36,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:22:36,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:22:36,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:22:36,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:22:36,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:22:36,957 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:22:36,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:22:36,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:22:36,958 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:22:36,958 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:22:36,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:22:36,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:22:36,958 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:22:36,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:22:36,959 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:22:36,959 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 -> f02b4d764a6f2b9378677160d85f84fe71fe9bb12a30ec7a53966c7051db5504 [2024-10-24 08:22:37,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:22:37,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:22:37,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:22:37,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:22:37,216 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:22:37,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-24 08:22:38,491 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:22:38,673 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:22:38,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-24 08:22:38,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/336de8b98/d5e39bfc4054402f8559bd7edb9c1d30/FLAG35a69cf4b [2024-10-24 08:22:39,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/336de8b98/d5e39bfc4054402f8559bd7edb9c1d30 [2024-10-24 08:22:39,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:22:39,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:22:39,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:22:39,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:22:39,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:22:39,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@762b368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39, skipping insertion in model container [2024-10-24 08:22:39,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:22:39,230 WARN L248 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_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-10-24 08:22:39,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:22:39,336 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:22:39,347 WARN L248 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_fillercode_fillercodestructure_filler-ps-co_file-42.i[919,932] [2024-10-24 08:22:39,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:22:39,403 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:22:39,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39 WrapperNode [2024-10-24 08:22:39,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:22:39,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:22:39,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:22:39,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:22:39,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,450 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-10-24 08:22:39,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:22:39,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:22:39,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:22:39,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:22:39,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,481 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-10-24 08:22:39,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,510 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:22:39,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:22:39,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:22:39,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:22:39,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (1/1) ... [2024-10-24 08:22:39,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:22:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:22:39,538 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-10-24 08:22:39,540 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-10-24 08:22:39,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:22:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:22:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:22:39,570 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:22:39,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:22:39,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:22:39,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:22:39,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:22:40,131 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 08:22:40,132 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:22:40,177 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:22:40,180 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:22:40,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:22:40 BoogieIcfgContainer [2024-10-24 08:22:40,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:22:40,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:22:40,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:22:40,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:22:40,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:22:39" (1/3) ... [2024-10-24 08:22:40,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745bd9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:22:40, skipping insertion in model container [2024-10-24 08:22:40,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:22:39" (2/3) ... [2024-10-24 08:22:40,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@745bd9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:22:40, skipping insertion in model container [2024-10-24 08:22:40,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:22:40" (3/3) ... [2024-10-24 08:22:40,186 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-42.i [2024-10-24 08:22:40,197 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:22:40,197 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:22:40,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:22:40,257 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;@475df5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:22:40,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:22:40,260 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 08:22:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 08:22:40,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:40,274 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:40,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:40,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:40,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1696566966, now seen corresponding path program 1 times [2024-10-24 08:22:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409603161] [2024-10-24 08:22:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:40,301 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-10-24 08:22:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:40,304 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-10-24 08:22:40,305 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-10-24 08:22:40,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:40,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:22:40,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-24 08:22:40,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:22:40,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:40,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409603161] [2024-10-24 08:22:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409603161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:40,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:22:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850438869] [2024-10-24 08:22:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:40,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:22:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:40,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:22:40,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:22:40,663 INFO L87 Difference]: Start difference. First operand has 84 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:40,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:40,750 INFO L93 Difference]: Finished difference Result 165 states and 299 transitions. [2024-10-24 08:22:40,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:22:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-24 08:22:40,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:40,774 INFO L225 Difference]: With dead ends: 165 [2024-10-24 08:22:40,774 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 08:22:40,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-10-24 08:22:40,780 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:40,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:22:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 08:22:40,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 08:22:40,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 51 states have internal predecessors, (71), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 08:22:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-24 08:22:40,821 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 187 [2024-10-24 08:22:40,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:40,821 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-24 08:22:40,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-24 08:22:40,822 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-24 08:22:40,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 08:22:40,824 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:40,825 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:40,836 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-10-24 08:22:41,025 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-10-24 08:22:41,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:41,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash 742667134, now seen corresponding path program 1 times [2024-10-24 08:22:41,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:41,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379979366] [2024-10-24 08:22:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:41,028 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-10-24 08:22:41,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:41,031 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-10-24 08:22:41,032 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-10-24 08:22:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:41,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 08:22:41,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:41,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-10-24 08:22:41,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-24 08:22:41,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379979366] [2024-10-24 08:22:41,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379979366] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:22:41,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:22:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-24 08:22:41,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674241615] [2024-10-24 08:22:41,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:22:41,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:22:41,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:41,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:22:41,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:22:41,728 INFO L87 Difference]: Start difference. First operand 82 states and 129 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, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-24 08:22:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:42,059 INFO L93 Difference]: Finished difference Result 169 states and 262 transitions. [2024-10-24 08:22:42,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:22:42,063 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, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 187 [2024-10-24 08:22:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:42,067 INFO L225 Difference]: With dead ends: 169 [2024-10-24 08:22:42,067 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 08:22:42,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:22:42,068 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 63 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:42,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 214 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:22:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 08:22:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-24 08:22:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 54 states have internal predecessors, (72), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-24 08:22:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2024-10-24 08:22:42,080 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 187 [2024-10-24 08:22:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:42,081 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2024-10-24 08:22:42,081 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, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-10-24 08:22:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2024-10-24 08:22:42,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-24 08:22:42,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:42,083 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:42,094 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-10-24 08:22:42,287 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-10-24 08:22:42,288 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:42,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:42,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1863356420, now seen corresponding path program 1 times [2024-10-24 08:22:42,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:42,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441665937] [2024-10-24 08:22:42,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:42,290 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-10-24 08:22:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:42,292 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-10-24 08:22:42,293 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-10-24 08:22:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:42,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 08:22:42,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:42,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:22:42,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:42,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441665937] [2024-10-24 08:22:42,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441665937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:42,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:42,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:22:42,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636362146] [2024-10-24 08:22:42,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:42,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:22:42,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:42,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:22:42,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:22:42,773 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:43,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:43,024 INFO L93 Difference]: Finished difference Result 257 states and 389 transitions. [2024-10-24 08:22:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:22:43,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-24 08:22:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:43,036 INFO L225 Difference]: With dead ends: 257 [2024-10-24 08:22:43,036 INFO L226 Difference]: Without dead ends: 172 [2024-10-24 08:22:43,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 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-10-24 08:22:43,038 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 94 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:43,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 363 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:22:43,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-24 08:22:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2024-10-24 08:22:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 89 states have internal predecessors, (112), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-24 08:22:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 228 transitions. [2024-10-24 08:22:43,063 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 228 transitions. Word has length 187 [2024-10-24 08:22:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:43,063 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 228 transitions. [2024-10-24 08:22:43,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 228 transitions. [2024-10-24 08:22:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:43,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:43,065 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:43,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 08:22:43,269 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-10-24 08:22:43,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash -263142898, now seen corresponding path program 1 times [2024-10-24 08:22:43,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:43,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667513642] [2024-10-24 08:22:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:43,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-10-24 08:22:43,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:43,273 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-10-24 08:22:43,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 (5)] Waiting until timeout for monitored process [2024-10-24 08:22:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:43,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:22:43,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:44,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:22:44,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:44,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667513642] [2024-10-24 08:22:44,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667513642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:44,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:44,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:22:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822686205] [2024-10-24 08:22:44,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:44,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:22:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:44,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:22:44,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:22:44,134 INFO L87 Difference]: Start difference. First operand 152 states and 228 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:44,736 INFO L93 Difference]: Finished difference Result 365 states and 552 transitions. [2024-10-24 08:22:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:22:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-24 08:22:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:44,743 INFO L225 Difference]: With dead ends: 365 [2024-10-24 08:22:44,743 INFO L226 Difference]: Without dead ends: 280 [2024-10-24 08:22:44,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:22:44,748 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 151 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:44,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 441 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:22:44,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-24 08:22:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 235. [2024-10-24 08:22:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.2836879432624113) internal successors, (181), 141 states have internal predecessors, (181), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 08:22:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 355 transitions. [2024-10-24 08:22:44,780 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 355 transitions. Word has length 188 [2024-10-24 08:22:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:44,781 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 355 transitions. [2024-10-24 08:22:44,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:44,781 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 355 transitions. [2024-10-24 08:22:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:44,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:44,786 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:44,799 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-10-24 08:22:44,986 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-10-24 08:22:44,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:44,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1274260148, now seen corresponding path program 1 times [2024-10-24 08:22:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821106408] [2024-10-24 08:22:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:44,988 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-10-24 08:22:44,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:44,991 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-10-24 08:22:44,991 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-10-24 08:22:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:45,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 08:22:45,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:45,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:45,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:22:45,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:45,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821106408] [2024-10-24 08:22:45,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821106408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:45,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:22:45,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:22:45,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874473781] [2024-10-24 08:22:45,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:45,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:22:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:22:45,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:22:45,237 INFO L87 Difference]: Start difference. First operand 235 states and 355 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:45,349 INFO L93 Difference]: Finished difference Result 403 states and 611 transitions. [2024-10-24 08:22:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:22:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-24 08:22:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:45,357 INFO L225 Difference]: With dead ends: 403 [2024-10-24 08:22:45,357 INFO L226 Difference]: Without dead ends: 235 [2024-10-24 08:22:45,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 186 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-10-24 08:22:45,359 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:45,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:22:45,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-24 08:22:45,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-10-24 08:22:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 141 states have internal predecessors, (179), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-24 08:22:45,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 353 transitions. [2024-10-24 08:22:45,387 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 353 transitions. Word has length 188 [2024-10-24 08:22:45,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:45,388 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 353 transitions. [2024-10-24 08:22:45,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 353 transitions. [2024-10-24 08:22:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:45,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:45,392 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:45,405 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 (6)] Forceful destruction successful, exit code 0 [2024-10-24 08:22:45,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-24 08:22:45,597 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:45,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2083606774, now seen corresponding path program 1 times [2024-10-24 08:22:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244728924] [2024-10-24 08:22:45,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:45,599 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-10-24 08:22:45,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:45,600 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-24 08:22:45,600 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 (7)] Waiting until timeout for monitored process [2024-10-24 08:22:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:45,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 08:22:45,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 863 proven. 111 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-10-24 08:22:46,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 114 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2024-10-24 08:22:46,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244728924] [2024-10-24 08:22:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244728924] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:22:46,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 08:22:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-24 08:22:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822139906] [2024-10-24 08:22:46,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 08:22:46,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 08:22:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 08:22:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:22:46,578 INFO L87 Difference]: Start difference. First operand 235 states and 353 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-24 08:22:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:47,432 INFO L93 Difference]: Finished difference Result 470 states and 670 transitions. [2024-10-24 08:22:47,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 08:22:47,432 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 188 [2024-10-24 08:22:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:47,435 INFO L225 Difference]: With dead ends: 470 [2024-10-24 08:22:47,435 INFO L226 Difference]: Without dead ends: 385 [2024-10-24 08:22:47,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 08:22:47,436 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 177 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:47,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 555 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:22:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-24 08:22:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 359. [2024-10-24 08:22:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 226 states have (on average 1.252212389380531) internal successors, (283), 226 states have internal predecessors, (283), 116 states have call successors, (116), 16 states have call predecessors, (116), 16 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-10-24 08:22:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 515 transitions. [2024-10-24 08:22:47,467 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 515 transitions. Word has length 188 [2024-10-24 08:22:47,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:47,468 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 515 transitions. [2024-10-24 08:22:47,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 3 states have call successors, (50), 3 states have call predecessors, (50), 7 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-10-24 08:22:47,468 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 515 transitions. [2024-10-24 08:22:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:47,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:47,470 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:47,481 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 (7)] Ended with exit code 0 [2024-10-24 08:22:47,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-24 08:22:47,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:47,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:47,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1624554508, now seen corresponding path program 1 times [2024-10-24 08:22:47,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:47,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967740258] [2024-10-24 08:22:47,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:47,672 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-10-24 08:22:47,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:47,673 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-24 08:22:47,674 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 (8)] Waiting until timeout for monitored process [2024-10-24 08:22:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:47,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 08:22:47,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-24 08:22:48,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:48,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967740258] [2024-10-24 08:22:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967740258] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:22:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2041470638] [2024-10-24 08:22:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:48,887 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:22:48,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:22:48,889 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:22:48,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-24 08:22:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:49,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 08:22:49,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:50,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:22:50,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2041470638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:50,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 08:22:50,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-24 08:22:50,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499875584] [2024-10-24 08:22:50,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:50,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:22:50,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:50,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:22:50,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:22:50,239 INFO L87 Difference]: Start difference. First operand 359 states and 515 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:51,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:51,786 INFO L93 Difference]: Finished difference Result 957 states and 1369 transitions. [2024-10-24 08:22:51,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:22:51,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-24 08:22:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:51,792 INFO L225 Difference]: With dead ends: 957 [2024-10-24 08:22:51,792 INFO L226 Difference]: Without dead ends: 670 [2024-10-24 08:22:51,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:22:51,793 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 88 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:51,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 443 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 08:22:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-24 08:22:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 631. [2024-10-24 08:22:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 399 states have (on average 1.2330827067669172) internal successors, (492), 399 states have internal predecessors, (492), 203 states have call successors, (203), 28 states have call predecessors, (203), 28 states have return successors, (203), 203 states have call predecessors, (203), 203 states have call successors, (203) [2024-10-24 08:22:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 898 transitions. [2024-10-24 08:22:51,837 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 898 transitions. Word has length 188 [2024-10-24 08:22:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:51,837 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 898 transitions. [2024-10-24 08:22:51,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 898 transitions. [2024-10-24 08:22:51,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 08:22:51,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:51,839 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:51,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-24 08:22:52,050 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 (8)] Ended with exit code 0 [2024-10-24 08:22:52,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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-10-24 08:22:52,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:52,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1366389070, now seen corresponding path program 1 times [2024-10-24 08:22:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:52,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340191321] [2024-10-24 08:22:52,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:52,242 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-10-24 08:22:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:52,244 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-24 08:22:52,245 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 (10)] Waiting until timeout for monitored process [2024-10-24 08:22:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:52,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 08:22:52,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-24 08:22:53,008 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:22:53,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:22:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340191321] [2024-10-24 08:22:53,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340191321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:22:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [253404126] [2024-10-24 08:22:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:53,357 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 08:22:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 08:22:53,359 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 08:22:53,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-24 08:22:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:53,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 08:22:53,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:22:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-24 08:22:54,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:22:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [253404126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:22:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 08:22:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-24 08:22:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311589138] [2024-10-24 08:22:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:22:54,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:22:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:22:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:22:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-24 08:22:54,345 INFO L87 Difference]: Start difference. First operand 631 states and 898 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:22:56,074 INFO L93 Difference]: Finished difference Result 1102 states and 1560 transitions. [2024-10-24 08:22:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:22:56,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2024-10-24 08:22:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:22:56,085 INFO L225 Difference]: With dead ends: 1102 [2024-10-24 08:22:56,085 INFO L226 Difference]: Without dead ends: 919 [2024-10-24 08:22:56,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:22:56,087 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 115 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:22:56,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 544 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 08:22:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-10-24 08:22:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 851. [2024-10-24 08:22:56,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 547 states have (on average 1.2394881170018281) internal successors, (678), 549 states have internal predecessors, (678), 265 states have call successors, (265), 38 states have call predecessors, (265), 38 states have return successors, (265), 263 states have call predecessors, (265), 265 states have call successors, (265) [2024-10-24 08:22:56,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1208 transitions. [2024-10-24 08:22:56,158 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1208 transitions. Word has length 188 [2024-10-24 08:22:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:22:56,159 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1208 transitions. [2024-10-24 08:22:56,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-24 08:22:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1208 transitions. [2024-10-24 08:22:56,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-10-24 08:22:56,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:22:56,161 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 08:22:56,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-10-24 08:22:56,372 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 (10)] Ended with exit code 0 [2024-10-24 08:22:56,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /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-10-24 08:22:56,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:22:56,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:22:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash 11550151, now seen corresponding path program 1 times [2024-10-24 08:22:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:22:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970668984] [2024-10-24 08:22:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:22:56,563 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-10-24 08:22:56,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:22:56,565 INFO L229 MonitoredProcess]: Starting monitored process 12 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-10-24 08:22:56,566 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 (12)] Waiting until timeout for monitored process [2024-10-24 08:22:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:22:56,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 08:22:56,786 INFO L278 TraceCheckSpWp]: Computing forward predicates...