./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-pe-cn_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-pe-cn_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 583df2ed5544a972dadd89472eff91929fe323dce02b65094581ff582d4e3330 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:15:19,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:15:20,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:15:20,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:15:20,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:15:20,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:15:20,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:15:20,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:15:20,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:15:20,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:15:20,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:15:20,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:15:20,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:15:20,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:15:20,098 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:15:20,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:15:20,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:15:20,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:15:20,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:15:20,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:15:20,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:15:20,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:15:20,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:15:20,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:15:20,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:15:20,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:15:20,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:15:20,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:15:20,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:15:20,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:15:20,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:15:20,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:15:20,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:15:20,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:15:20,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:15:20,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:15:20,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:15:20,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:15:20,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:15:20,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:15:20,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:15:20,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:15:20,108 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 -> 583df2ed5544a972dadd89472eff91929fe323dce02b65094581ff582d4e3330 [2024-10-14 09:15:20,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:15:20,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:15:20,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:15:20,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:15:20,340 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:15:20,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-42.i [2024-10-14 09:15:21,642 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:15:21,804 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:15:21,804 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-42.i [2024-10-14 09:15:21,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0450d4cab/c2813425dd6740578737cc425b1f49c5/FLAG640ba33f0 [2024-10-14 09:15:22,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0450d4cab/c2813425dd6740578737cc425b1f49c5 [2024-10-14 09:15:22,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:15:22,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:15:22,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:15:22,206 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:15:22,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:15:22,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,211 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64085589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22, skipping insertion in model container [2024-10-14 09:15:22,211 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:15:22,355 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-pe-cn_file-42.i[919,932] [2024-10-14 09:15:22,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:15:22,465 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:15:22,475 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-pe-cn_file-42.i[919,932] [2024-10-14 09:15:22,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:15:22,536 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:15:22,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22 WrapperNode [2024-10-14 09:15:22,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:15:22,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:15:22,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:15:22,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:15:22,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,606 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2024-10-14 09:15:22,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:15:22,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:15:22,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:15:22,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:15:22,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,645 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-14 09:15:22,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:15:22,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:15:22,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:15:22,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:15:22,680 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (1/1) ... [2024-10-14 09:15:22,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:15:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:15:22,705 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-14 09:15:22,710 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-14 09:15:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:15:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:15:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:15:22,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:15:22,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:15:22,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:15:22,927 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:15:22,929 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:15:23,234 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 09:15:23,235 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:15:23,263 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:15:23,267 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:15:23,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:15:23 BoogieIcfgContainer [2024-10-14 09:15:23,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:15:23,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:15:23,269 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:15:23,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:15:23,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:15:22" (1/3) ... [2024-10-14 09:15:23,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586db4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:15:23, skipping insertion in model container [2024-10-14 09:15:23,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:22" (2/3) ... [2024-10-14 09:15:23,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586db4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:15:23, skipping insertion in model container [2024-10-14 09:15:23,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:15:23" (3/3) ... [2024-10-14 09:15:23,274 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-42.i [2024-10-14 09:15:23,286 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:15:23,287 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:15:23,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:15:23,337 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;@29342b29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:15:23,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:15:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 09:15:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 09:15:23,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:23,355 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:23,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:23,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -266428533, now seen corresponding path program 1 times [2024-10-14 09:15:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735690800] [2024-10-14 09:15:23,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:15:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:15:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:15:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:15:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:15:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:15:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:15:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:15:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:15:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:15:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:15:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:15:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:15:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:15:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:15:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:15:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:15:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:15:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:15:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:15:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:15:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:15:23,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:15:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:15:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:15:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:15:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:15:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:15:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:15:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:15:23,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 09:15:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:15:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 09:15:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 09:15:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 09:15:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 09:15:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 09:15:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:15:23,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735690800] [2024-10-14 09:15:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735690800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:23,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:23,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:15:23,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956323367] [2024-10-14 09:15:23,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:23,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:15:23,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:23,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:15:23,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:15:23,804 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 09:15:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:23,847 INFO L93 Difference]: Finished difference Result 186 states and 343 transitions. [2024-10-14 09:15:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:15:23,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 230 [2024-10-14 09:15:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:23,859 INFO L225 Difference]: With dead ends: 186 [2024-10-14 09:15:23,859 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 09:15:23,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-14 09:15:23,872 INFO L432 NwaCegarLoop]: 144 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, 144 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-14 09:15:23,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:15:23,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 09:15:23,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 09:15:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 09:15:23,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 147 transitions. [2024-10-14 09:15:23,954 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 147 transitions. Word has length 230 [2024-10-14 09:15:23,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:23,955 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 147 transitions. [2024-10-14 09:15:23,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 09:15:23,955 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 147 transitions. [2024-10-14 09:15:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 09:15:23,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:23,962 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:23,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:15:23,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:23,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1584078605, now seen corresponding path program 1 times [2024-10-14 09:15:23,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:23,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45117384] [2024-10-14 09:15:23,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:23,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:15:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:15:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:15:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:15:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:15:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:15:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:15:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:15:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:15:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:15:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:15:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:15:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:15:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:15:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:15:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:15:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:15:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:15:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:15:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:15:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:15:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:15:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:15:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:15:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:15:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:15:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:15:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:15:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:15:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:15:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 09:15:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:15:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 09:15:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 09:15:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 09:15:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 09:15:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 09:15:24,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:15:24,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:24,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45117384] [2024-10-14 09:15:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45117384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:24,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:24,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:15:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709612354] [2024-10-14 09:15:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:24,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:15:24,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:15:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:15:24,328 INFO L87 Difference]: Start difference. First operand 92 states and 147 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:24,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:24,388 INFO L93 Difference]: Finished difference Result 224 states and 353 transitions. [2024-10-14 09:15:24,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:15:24,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 230 [2024-10-14 09:15:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:24,391 INFO L225 Difference]: With dead ends: 224 [2024-10-14 09:15:24,391 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 09:15:24,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 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-14 09:15:24,396 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 58 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 328 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-14 09:15:24,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 328 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:15:24,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 09:15:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-10-14 09:15:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 73 states have internal predecessors, (94), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-14 09:15:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 204 transitions. [2024-10-14 09:15:24,427 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 204 transitions. Word has length 230 [2024-10-14 09:15:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:24,428 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 204 transitions. [2024-10-14 09:15:24,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:24,428 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 204 transitions. [2024-10-14 09:15:24,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 09:15:24,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:24,433 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:24,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:15:24,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:24,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:24,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1641336907, now seen corresponding path program 1 times [2024-10-14 09:15:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:24,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833971758] [2024-10-14 09:15:24,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:24,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:15:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:15:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:15:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:15:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:15:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:15:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:15:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:15:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:15:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:15:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:15:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:15:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:15:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:15:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:15:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:15:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:15:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:15:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:15:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:15:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:15:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:15:24,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:15:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:15:24,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:15:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:15:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:15:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:15:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:15:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:15:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 09:15:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:15:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 09:15:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 09:15:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 09:15:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 09:15:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 09:15:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:15:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833971758] [2024-10-14 09:15:24,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833971758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:24,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:24,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:15:24,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191744539] [2024-10-14 09:15:24,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:24,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:15:24,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:24,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:15:24,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:15:24,863 INFO L87 Difference]: Start difference. First operand 130 states and 204 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:25,063 INFO L93 Difference]: Finished difference Result 358 states and 563 transitions. [2024-10-14 09:15:25,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:15:25,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 230 [2024-10-14 09:15:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:25,070 INFO L225 Difference]: With dead ends: 358 [2024-10-14 09:15:25,072 INFO L226 Difference]: Without dead ends: 229 [2024-10-14 09:15:25,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 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-14 09:15:25,075 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 96 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:25,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 426 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:15:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-14 09:15:25,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 193. [2024-10-14 09:15:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 98 states have internal predecessors, (119), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-14 09:15:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 303 transitions. [2024-10-14 09:15:25,119 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 303 transitions. Word has length 230 [2024-10-14 09:15:25,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:25,119 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 303 transitions. [2024-10-14 09:15:25,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 303 transitions. [2024-10-14 09:15:25,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:25,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:25,125 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:25,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:15:25,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:25,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:25,126 INFO L85 PathProgramCache]: Analyzing trace with hash -448229988, now seen corresponding path program 1 times [2024-10-14 09:15:25,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:25,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533448629] [2024-10-14 09:15:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:25,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:15:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:15:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:15:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:15:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:15:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:15:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:15:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:15:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:15:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:15:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:15:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:15:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:15:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:15:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:15:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:15:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:15:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:15:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:15:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:15:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:15:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:15:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:15:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:15:25,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:15:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:15:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:15:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:15:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:15:25,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:15:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 09:15:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:15:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 09:15:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 09:15:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 09:15:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 09:15:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 09:15:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:15:25,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:25,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533448629] [2024-10-14 09:15:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533448629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:15:25,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196664159] [2024-10-14 09:15:25,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:25,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:15:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:15:25,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:15:25,439 INFO L87 Difference]: Start difference. First operand 193 states and 303 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:25,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:25,480 INFO L93 Difference]: Finished difference Result 322 states and 506 transitions. [2024-10-14 09:15:25,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:15:25,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 231 [2024-10-14 09:15:25,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:25,484 INFO L225 Difference]: With dead ends: 322 [2024-10-14 09:15:25,484 INFO L226 Difference]: Without dead ends: 193 [2024-10-14 09:15:25,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 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-14 09:15:25,486 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 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-14 09:15:25,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:15:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-14 09:15:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-10-14 09:15:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 98 states have internal predecessors, (118), 92 states have call successors, (92), 3 states have call predecessors, (92), 3 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-14 09:15:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 302 transitions. [2024-10-14 09:15:25,526 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 302 transitions. Word has length 231 [2024-10-14 09:15:25,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:25,526 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 302 transitions. [2024-10-14 09:15:25,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:25,527 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 302 transitions. [2024-10-14 09:15:25,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:25,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:25,530 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:25,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:15:25,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:25,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2036577890, now seen corresponding path program 1 times [2024-10-14 09:15:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:25,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616732788] [2024-10-14 09:15:25,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:25,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:15:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:15:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:15:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:15:25,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:15:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:15:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:15:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:15:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:15:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:15:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:15:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:15:25,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:15:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:15:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:15:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:15:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:15:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:15:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:15:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:15:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:15:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:15:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:15:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:15:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:15:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:15:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:15:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:15:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:15:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:15:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 09:15:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:15:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 09:15:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 09:15:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 09:15:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 09:15:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 09:15:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:25,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-10-14 09:15:25,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:25,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616732788] [2024-10-14 09:15:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616732788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:15:25,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518150334] [2024-10-14 09:15:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:25,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:15:25,884 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-14 09:15:25,886 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-14 09:15:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:26,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:15:26,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1368 proven. 54 refuted. 0 times theorem prover too weak. 1242 trivial. 0 not checked. [2024-10-14 09:15:26,332 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:15:26,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-10-14 09:15:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518150334] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:15:26,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:15:26,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 09:15:26,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490739327] [2024-10-14 09:15:26,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:15:26,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:15:26,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:15:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:15:26,616 INFO L87 Difference]: Start difference. First operand 193 states and 302 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-10-14 09:15:26,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:26,831 INFO L93 Difference]: Finished difference Result 296 states and 457 transitions. [2024-10-14 09:15:26,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:15:26,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 231 [2024-10-14 09:15:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:26,834 INFO L225 Difference]: With dead ends: 296 [2024-10-14 09:15:26,834 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 09:15:26,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 531 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:15:26,835 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 57 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:26,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 225 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:15:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 09:15:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 163. [2024-10-14 09:15:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 84 states have (on average 1.2023809523809523) internal successors, (101), 84 states have internal predecessors, (101), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-14 09:15:26,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 249 transitions. [2024-10-14 09:15:26,852 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 249 transitions. Word has length 231 [2024-10-14 09:15:26,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:26,853 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 249 transitions. [2024-10-14 09:15:26,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-10-14 09:15:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 249 transitions. [2024-10-14 09:15:26,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:26,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:26,855 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:26,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:15:27,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:27,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:27,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash 426123742, now seen corresponding path program 1 times [2024-10-14 09:15:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695824035] [2024-10-14 09:15:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:27,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:15:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:15:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:15:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:15:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:15:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:15:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:15:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:15:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:15:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:15:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:15:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:15:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:15:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:15:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:15:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:15:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:15:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:15:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:15:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 09:15:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 09:15:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 09:15:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 09:15:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 09:15:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 09:15:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 09:15:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 09:15:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 09:15:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 09:15:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 09:15:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 09:15:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 09:15:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 09:15:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 09:15:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 09:15:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-14 09:15:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-14 09:15:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 159 refuted. 0 times theorem prover too weak. 2454 trivial. 0 not checked. [2024-10-14 09:15:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695824035] [2024-10-14 09:15:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695824035] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:15:27,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069582393] [2024-10-14 09:15:27,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:27,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:27,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:15:27,638 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-14 09:15:27,639 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-14 09:15:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:27,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 09:15:27,766 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 09:15:28,520 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:15:29,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2024-10-14 09:15:29,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069582393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:15:29,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:15:29,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-14 09:15:29,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852207274] [2024-10-14 09:15:29,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:15:29,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 09:15:29,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:29,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 09:15:29,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-14 09:15:29,010 INFO L87 Difference]: Start difference. First operand 163 states and 249 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2024-10-14 09:15:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:30,143 INFO L93 Difference]: Finished difference Result 503 states and 733 transitions. [2024-10-14 09:15:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-14 09:15:30,144 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) Word has length 231 [2024-10-14 09:15:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:30,147 INFO L225 Difference]: With dead ends: 503 [2024-10-14 09:15:30,147 INFO L226 Difference]: Without dead ends: 408 [2024-10-14 09:15:30,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 529 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 09:15:30,148 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 366 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:30,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 972 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 09:15:30,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-10-14 09:15:30,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 279. [2024-10-14 09:15:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 155 states have (on average 1.206451612903226) internal successors, (187), 155 states have internal predecessors, (187), 111 states have call successors, (111), 12 states have call predecessors, (111), 12 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-14 09:15:30,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 409 transitions. [2024-10-14 09:15:30,183 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 409 transitions. Word has length 231 [2024-10-14 09:15:30,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:30,183 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 409 transitions. [2024-10-14 09:15:30,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (68), 3 states have call predecessors, (68), 3 states have call successors, (68) [2024-10-14 09:15:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 409 transitions. [2024-10-14 09:15:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:30,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:30,185 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:30,203 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-14 09:15:30,386 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,SelfDestructingSolverStorable5 [2024-10-14 09:15:30,386 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:30,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 644978460, now seen corresponding path program 1 times [2024-10-14 09:15:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117965717] [2024-10-14 09:15:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:15:30,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1467033964] [2024-10-14 09:15:30,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:30,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:30,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:15:30,478 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-14 09:15:30,480 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-14 09:15:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:30,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 09:15:30,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-10-14 09:15:32,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:15:33,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117965717] [2024-10-14 09:15:33,136 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:15:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467033964] [2024-10-14 09:15:33,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467033964] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:15:33,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:15:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-14 09:15:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248132463] [2024-10-14 09:15:33,137 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 09:15:33,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 09:15:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 09:15:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-14 09:15:33,138 INFO L87 Difference]: Start difference. First operand 279 states and 409 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 09:15:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:33,949 INFO L93 Difference]: Finished difference Result 838 states and 1222 transitions. [2024-10-14 09:15:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 09:15:33,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 231 [2024-10-14 09:15:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:33,953 INFO L225 Difference]: With dead ends: 838 [2024-10-14 09:15:33,953 INFO L226 Difference]: Without dead ends: 635 [2024-10-14 09:15:33,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 431 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-14 09:15:33,955 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 146 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 89 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:33,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1286 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 657 Invalid, 6 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:15:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-14 09:15:34,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 492. [2024-10-14 09:15:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 283 states have (on average 1.2190812720848057) internal successors, (345), 283 states have internal predecessors, (345), 185 states have call successors, (185), 23 states have call predecessors, (185), 23 states have return successors, (185), 185 states have call predecessors, (185), 185 states have call successors, (185) [2024-10-14 09:15:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 715 transitions. [2024-10-14 09:15:34,074 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 715 transitions. Word has length 231 [2024-10-14 09:15:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:34,075 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 715 transitions. [2024-10-14 09:15:34,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 09:15:34,075 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 715 transitions. [2024-10-14 09:15:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:34,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:34,078 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:34,092 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-14 09:15:34,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:34,282 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:34,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash 222276634, now seen corresponding path program 1 times [2024-10-14 09:15:34,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:34,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764525069] [2024-10-14 09:15:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:15:34,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566481593] [2024-10-14 09:15:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:34,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:34,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:15:34,371 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-14 09:15:34,372 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-14 09:15:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:34,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 09:15:34,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:35,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 348 proven. 198 refuted. 0 times theorem prover too weak. 2118 trivial. 0 not checked. [2024-10-14 09:15:35,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:15:36,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:15:36,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764525069] [2024-10-14 09:15:36,021 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 09:15:36,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566481593] [2024-10-14 09:15:36,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566481593] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:15:36,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:15:36,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-14 09:15:36,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413046035] [2024-10-14 09:15:36,022 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 09:15:36,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 09:15:36,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:15:36,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 09:15:36,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=273, Unknown=6, NotChecked=0, Total=380 [2024-10-14 09:15:36,023 INFO L87 Difference]: Start difference. First operand 492 states and 715 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-10-14 09:15:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:36,659 INFO L93 Difference]: Finished difference Result 1105 states and 1578 transitions. [2024-10-14 09:15:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 09:15:36,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 231 [2024-10-14 09:15:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:36,665 INFO L225 Difference]: With dead ends: 1105 [2024-10-14 09:15:36,665 INFO L226 Difference]: Without dead ends: 902 [2024-10-14 09:15:36,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=326, Invalid=790, Unknown=6, NotChecked=0, Total=1122 [2024-10-14 09:15:36,668 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 192 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:36,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1092 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:15:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-14 09:15:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 780. [2024-10-14 09:15:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 476 states have (on average 1.2436974789915967) internal successors, (592), 478 states have internal predecessors, (592), 263 states have call successors, (263), 40 states have call predecessors, (263), 40 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2024-10-14 09:15:36,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1118 transitions. [2024-10-14 09:15:36,791 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1118 transitions. Word has length 231 [2024-10-14 09:15:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:36,792 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1118 transitions. [2024-10-14 09:15:36,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (37), 3 states have call predecessors, (37), 4 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-10-14 09:15:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1118 transitions. [2024-10-14 09:15:36,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-14 09:15:36,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:36,794 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:36,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 09:15:36,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:36,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:36,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:36,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2144976064, now seen corresponding path program 1 times [2024-10-14 09:15:36,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:15:36,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196263713] [2024-10-14 09:15:36,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:15:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:15:37,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1419809721] [2024-10-14 09:15:37,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:37,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:37,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:15:37,074 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-14 09:15:37,078 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-14 09:15:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:15:37,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:15:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:15:37,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:15:37,350 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:15:37,351 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:15:37,369 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-14 09:15:37,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:15:37,556 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:15:37,669 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:15:37,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:15:37 BoogieIcfgContainer [2024-10-14 09:15:37,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:15:37,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:15:37,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:15:37,672 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:15:37,672 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:15:23" (3/4) ... [2024-10-14 09:15:37,674 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:15:37,675 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:15:37,675 INFO L158 Benchmark]: Toolchain (without parser) took 15470.27ms. Allocated memory was 218.1MB in the beginning and 474.0MB in the end (delta: 255.9MB). Free memory was 147.6MB in the beginning and 265.8MB in the end (delta: -118.2MB). Peak memory consumption was 137.9MB. Max. memory is 16.1GB. [2024-10-14 09:15:37,675 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory was 89.2MB in the beginning and 89.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:15:37,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.34ms. Allocated memory is still 218.1MB. Free memory was 147.6MB in the beginning and 130.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:15:37,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.25ms. Allocated memory is still 218.1MB. Free memory was 130.4MB in the beginning and 125.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:15:37,676 INFO L158 Benchmark]: Boogie Preprocessor took 70.42ms. Allocated memory is still 218.1MB. Free memory was 125.8MB in the beginning and 119.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 09:15:37,676 INFO L158 Benchmark]: RCFGBuilder took 589.24ms. Allocated memory is still 218.1MB. Free memory was 119.3MB in the beginning and 156.0MB in the end (delta: -36.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-14 09:15:37,676 INFO L158 Benchmark]: TraceAbstraction took 14402.12ms. Allocated memory was 218.1MB in the beginning and 474.0MB in the end (delta: 255.9MB). Free memory was 155.1MB in the beginning and 265.8MB in the end (delta: -110.7MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. [2024-10-14 09:15:37,676 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 474.0MB. Free memory is still 265.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:15:37,677 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 125.8MB. Free memory was 89.2MB in the beginning and 89.1MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.34ms. Allocated memory is still 218.1MB. Free memory was 147.6MB in the beginning and 130.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.25ms. Allocated memory is still 218.1MB. Free memory was 130.4MB in the beginning and 125.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.42ms. Allocated memory is still 218.1MB. Free memory was 125.8MB in the beginning and 119.3MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 589.24ms. Allocated memory is still 218.1MB. Free memory was 119.3MB in the beginning and 156.0MB in the end (delta: -36.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14402.12ms. Allocated memory was 218.1MB in the beginning and 474.0MB in the end (delta: 255.9MB). Free memory was 155.1MB in the beginning and 265.8MB in the end (delta: -110.7MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 474.0MB. Free memory is still 265.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 216, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 120. 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_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] float var_1_28 = 255.5; [L44] float var_1_29 = 7.5; [L45] float var_1_30 = 9.8; [L46] unsigned char var_1_31 = 4; [L47] signed long int var_1_32 = 1; [L48] unsigned char var_1_33 = 2; [L49] unsigned short int var_1_34 = 1; [L50] unsigned long int var_1_35 = 10; [L51] unsigned char var_1_36 = 10; [L52] unsigned char var_1_37 = 128; [L53] unsigned char var_1_38 = 16; [L54] unsigned char var_1_39 = 0; [L55] unsigned short int var_1_40 = 10; [L56] unsigned short int var_1_41 = 128; [L57] unsigned short int var_1_42 = 40597; [L58] signed short int last_1_var_1_1 = 16; [L59] unsigned char last_1_var_1_6 = 10; [L60] unsigned char last_1_var_1_8 = 1; [L61] signed short int last_1_var_1_13 = 200; [L220] isInitial = 1 [L221] FCALL initially() [L222] COND TRUE 1 [L223] CALL updateLastVariables() [L210] last_1_var_1_1 = var_1_1 [L211] last_1_var_1_6 = var_1_6 [L212] last_1_var_1_8 = var_1_8 [L213] last_1_var_1_13 = var_1_13 [L223] RET updateLastVariables() [L224] CALL updateVariables() [L151] var_1_5 = __VERIFIER_nondet_char() [L152] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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] [L152] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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] [L153] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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] [L153] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L155] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L156] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L156] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L157] var_1_11 = __VERIFIER_nondet_uchar() [L158] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L158] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L159] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L159] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L160] var_1_12 = __VERIFIER_nondet_uchar() [L161] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L161] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L162] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L162] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L163] var_1_15 = __VERIFIER_nondet_float() [L164] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L164] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L165] var_1_16 = __VERIFIER_nondet_float() [L166] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L166] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L167] var_1_20 = __VERIFIER_nondet_uchar() [L168] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L168] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L169] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L169] 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_22=0, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L170] var_1_22 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_22 >= 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_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L171] RET assume_abort_if_not(var_1_22 >= 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_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L172] CALL assume_abort_if_not(var_1_22 <= 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_22=-255, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L172] RET assume_abort_if_not(var_1_22 <= 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_22=-255, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L173] var_1_23 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_23 >= 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_22=-255, var_1_24=-32, 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_32=1, 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=-55, 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_22=-255, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L174] RET assume_abort_if_not(var_1_23 >= 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_22=-255, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L175] CALL assume_abort_if_not(var_1_23 <= 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_22=-255, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L175] RET assume_abort_if_not(var_1_23 <= 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_22=-255, var_1_23=1, var_1_24=-32, 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_32=1, 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=-55, var_1_8=1] [L176] var_1_24 = __VERIFIER_nondet_short() [L177] CALL assume_abort_if_not(var_1_24 >= -32768) 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L177] RET assume_abort_if_not(var_1_24 >= -32768) 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L178] CALL assume_abort_if_not(var_1_24 <= 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L178] RET assume_abort_if_not(var_1_24 <= 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L180] 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L181] 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L181] 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_22=-255, var_1_23=1, var_1_24=2, 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_32=1, 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=-55, var_1_8=1] [L182] var_1_27 = __VERIFIER_nondet_long() [L183] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L183] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L184] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L184] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L185] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L185] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_28=511/2, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L186] var_1_28 = __VERIFIER_nondet_float() [L187] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L187] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_29=15/2, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L188] var_1_29 = __VERIFIER_nondet_float() [L189] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L189] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=1, 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=-55, var_1_8=1] [L190] var_1_32 = __VERIFIER_nondet_long() [L191] CALL assume_abort_if_not(var_1_32 >= -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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, 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=-55, var_1_8=1] [L191] RET assume_abort_if_not(var_1_32 >= -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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, 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=-55, var_1_8=1] [L192] CALL assume_abort_if_not(var_1_32 <= 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, 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=-55, var_1_8=1] [L192] RET assume_abort_if_not(var_1_32 <= 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, 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=-55, var_1_8=1] [L193] var_1_33 = __VERIFIER_nondet_uchar() [L194] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=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=-55, var_1_8=1] [L194] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=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=-55, var_1_8=1] [L195] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L195] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L196] var_1_37 = __VERIFIER_nondet_uchar() [L197] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L197] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L198] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L198] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L199] var_1_38 = __VERIFIER_nondet_uchar() [L200] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L200] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, 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=-55, var_1_8=1] [L201] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L201] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L202] var_1_39 = __VERIFIER_nondet_uchar() [L203] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=-55, var_1_8=1] [L203] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, var_1_40=10, var_1_41=128, var_1_42=40597, var_1_5=-3, var_1_6=10, var_1_7=-55, var_1_8=1] [L204] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L204] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L205] var_1_42 = __VERIFIER_nondet_ushort() [L206] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L206] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L207] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L207] 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_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L224] RET updateVariables() [L225] CALL step() [L65] signed long int stepLocal_6 = last_1_var_1_1; [L66] 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=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L67] 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=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L68] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L71] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L76] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L79] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L82] unsigned char stepLocal_4 = var_1_6; [L83] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L84] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L85] 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))) [L86] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L93] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L94] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L97] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L98] COND TRUE \read(var_1_19) [L99] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L105] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L106] 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=-55, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=1] [L107] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L114] 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=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L116] COND TRUE var_1_22 || var_1_23 [L117] var_1_21 = ((var_1_24 > -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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_26=10013/20, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L119] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L120] 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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_30=49/5, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L122] COND TRUE (- var_1_28) < ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) [L123] 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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=4, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L125] COND TRUE ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_24)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_24))) <= var_1_32 [L126] 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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=1, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L128] COND TRUE var_1_31 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24))) [L129] var_1_34 = ((((((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) > (var_1_33)) ? (((((var_1_31) < 0 ) ? -(var_1_31) : (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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=0, var_1_35=10, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L131] COND TRUE \read(var_1_25) [L132] 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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L134] COND TRUE \read(var_1_25) [L135] 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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L139] COND TRUE (- var_1_36) != var_1_34 [L140] 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, stepLocal_0=10, stepLocal_1=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=127, var_1_38=382, 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=-55, var_1_8=0] [L142] COND FALSE !(var_1_33 <= (~ var_1_34)) [L147] var_1_41 = var_1_36 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=-55, var_1_11=1, var_1_12=0, var_1_13=201, var_1_14=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=127, var_1_38=382, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=-55, var_1_8=0] [L225] RET step() [L226] CALL, EXPR property() [L216-L217] 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) ; [L226] RET, EXPR property() [L226] 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=127, var_1_38=382, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=-55, 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=2, var_1_16=2, var_1_17=16, var_1_19=1, var_1_1=10, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=1, var_1_24=2, var_1_25=1, var_1_27=26, var_1_29=3, var_1_30=3, var_1_31=256, var_1_32=2, var_1_33=256, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=127, var_1_38=382, var_1_39=0, var_1_40=0, var_1_41=1, var_1_42=32767, var_1_5=-3, var_1_6=10, var_1_7=-55, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 9, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 972 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 915 mSDsluCounter, 4748 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3473 mSDsCounter, 463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2605 IncrementalHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 463 mSolverCounterUnsat, 1275 mSDtfsCounter, 2605 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2379 GetRequests, 2260 SyntacticMatches, 5 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=8, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 437 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 3233 NumberOfCodeBlocks, 3233 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2757 ConstructedInterpolants, 1 QuantifiedInterpolants, 14391 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2122 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 31026/31968 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-14 09:15:37,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_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 583df2ed5544a972dadd89472eff91929fe323dce02b65094581ff582d4e3330 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:15:39,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:15:39,849 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:15:39,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:15:39,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:15:39,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:15:39,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:15:39,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:15:39,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:15:39,893 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:15:39,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:15:39,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:15:39,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:15:39,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:15:39,896 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:15:39,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:15:39,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:15:39,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:15:39,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:15:39,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:15:39,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:15:39,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:15:39,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:15:39,901 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:15:39,902 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:15:39,902 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:15:39,902 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:15:39,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:15:39,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:15:39,902 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:15:39,902 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:15:39,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:15:39,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:15:39,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:15:39,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:15:39,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:15:39,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:15:39,903 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:15:39,903 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:15:39,904 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:15:39,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:15:39,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:15:39,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:15:39,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:15:39,910 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:15:39,910 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 -> 583df2ed5544a972dadd89472eff91929fe323dce02b65094581ff582d4e3330 [2024-10-14 09:15:40,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:15:40,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:15:40,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:15:40,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:15:40,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:15:40,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-42.i [2024-10-14 09:15:41,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:15:41,862 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:15:41,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-42.i [2024-10-14 09:15:41,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4e771fe/22c6c434415b445da17032abcee11c5e/FLAG33d15c8c4 [2024-10-14 09:15:42,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4e771fe/22c6c434415b445da17032abcee11c5e [2024-10-14 09:15:42,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:15:42,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:15:42,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:15:42,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:15:42,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:15:42,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@625eb68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42, skipping insertion in model container [2024-10-14 09:15:42,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:15:42,340 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-pe-cn_file-42.i[919,932] [2024-10-14 09:15:42,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:15:42,448 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:15:42,459 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-pe-cn_file-42.i[919,932] [2024-10-14 09:15:42,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:15:42,532 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:15:42,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42 WrapperNode [2024-10-14 09:15:42,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:15:42,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:15:42,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:15:42,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:15:42,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,593 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-10-14 09:15:42,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:15:42,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:15:42,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:15:42,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:15:42,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,635 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-14 09:15:42,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:15:42,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:15:42,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:15:42,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:15:42,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (1/1) ... [2024-10-14 09:15:42,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:15:42,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:15:42,715 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-14 09:15:42,717 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-14 09:15:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:15:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:15:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:15:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:15:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:15:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:15:42,907 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:15:42,909 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:15:43,491 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 09:15:43,492 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:15:43,549 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:15:43,553 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:15:43,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:15:43 BoogieIcfgContainer [2024-10-14 09:15:43,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:15:43,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:15:43,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:15:43,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:15:43,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:15:42" (1/3) ... [2024-10-14 09:15:43,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69897367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:15:43, skipping insertion in model container [2024-10-14 09:15:43,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:15:42" (2/3) ... [2024-10-14 09:15:43,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69897367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:15:43, skipping insertion in model container [2024-10-14 09:15:43,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:15:43" (3/3) ... [2024-10-14 09:15:43,564 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-42.i [2024-10-14 09:15:43,581 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:15:43,581 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:15:43,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:15:43,675 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;@23fcbbca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:15:43,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:15:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 09:15:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 09:15:43,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:43,693 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:43,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash -266428533, now seen corresponding path program 1 times [2024-10-14 09:15:43,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:15:43,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923815080] [2024-10-14 09:15:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:43,710 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-14 09:15:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:15:43,714 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-14 09:15:43,737 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-14 09:15:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:44,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:15:44,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1172 proven. 0 refuted. 0 times theorem prover too weak. 1492 trivial. 0 not checked. [2024-10-14 09:15:44,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:15:44,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:15:44,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923815080] [2024-10-14 09:15:44,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923815080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:44,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:44,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:15:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624111791] [2024-10-14 09:15:44,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:44,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:15:44,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:15:44,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:15:44,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:15:44,175 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 09:15:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:44,316 INFO L93 Difference]: Finished difference Result 186 states and 343 transitions. [2024-10-14 09:15:44,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:15:44,324 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 230 [2024-10-14 09:15:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:44,330 INFO L225 Difference]: With dead ends: 186 [2024-10-14 09:15:44,331 INFO L226 Difference]: Without dead ends: 92 [2024-10-14 09:15:44,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 229 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-14 09:15:44,337 INFO L432 NwaCegarLoop]: 144 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, 144 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-14 09:15:44,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:15:44,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-14 09:15:44,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-14 09:15:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 09:15:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 147 transitions. [2024-10-14 09:15:44,389 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 147 transitions. Word has length 230 [2024-10-14 09:15:44,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:44,390 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 147 transitions. [2024-10-14 09:15:44,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-10-14 09:15:44,391 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 147 transitions. [2024-10-14 09:15:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-14 09:15:44,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:44,401 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:44,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:15:44,602 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-14 09:15:44,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:44,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1584078605, now seen corresponding path program 1 times [2024-10-14 09:15:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:15:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579126236] [2024-10-14 09:15:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:44,607 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-14 09:15:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:15:44,609 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-14 09:15:44,613 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-14 09:15:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:44,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 09:15:44,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:15:45,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:15:45,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:15:45,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579126236] [2024-10-14 09:15:45,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579126236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:45,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:45,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:15:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836082917] [2024-10-14 09:15:45,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:45,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:15:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:15:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:15:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:15:45,332 INFO L87 Difference]: Start difference. First operand 92 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:45,876 INFO L93 Difference]: Finished difference Result 275 states and 440 transitions. [2024-10-14 09:15:45,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:15:45,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 230 [2024-10-14 09:15:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:45,884 INFO L225 Difference]: With dead ends: 275 [2024-10-14 09:15:45,884 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 09:15:45,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 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-14 09:15:45,885 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 93 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:45,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 426 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:15:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 09:15:45,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2024-10-14 09:15:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 78 states have internal predecessors, (98), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-14 09:15:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 246 transitions. [2024-10-14 09:15:45,909 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 246 transitions. Word has length 230 [2024-10-14 09:15:45,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:45,910 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 246 transitions. [2024-10-14 09:15:45,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 246 transitions. [2024-10-14 09:15:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:45,912 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:45,912 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:45,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:15:46,112 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-14 09:15:46,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -505488290, now seen corresponding path program 1 times [2024-10-14 09:15:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:15:46,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520109550] [2024-10-14 09:15:46,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:46,117 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-14 09:15:46,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:15:46,121 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-14 09:15:46,124 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-14 09:15:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:46,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 09:15:46,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:15:46,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:15:46,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:15:46,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520109550] [2024-10-14 09:15:46,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520109550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:46,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:15:46,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:15:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057937434] [2024-10-14 09:15:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:46,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:15:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:15:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:15:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:15:46,426 INFO L87 Difference]: Start difference. First operand 155 states and 246 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:46,562 INFO L93 Difference]: Finished difference Result 246 states and 392 transitions. [2024-10-14 09:15:46,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:15:46,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 231 [2024-10-14 09:15:46,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:46,570 INFO L225 Difference]: With dead ends: 246 [2024-10-14 09:15:46,570 INFO L226 Difference]: Without dead ends: 155 [2024-10-14 09:15:46,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 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-14 09:15:46,571 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:46,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:15:46,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-14 09:15:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-14 09:15:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-14 09:15:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 245 transitions. [2024-10-14 09:15:46,588 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 245 transitions. Word has length 231 [2024-10-14 09:15:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:46,589 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 245 transitions. [2024-10-14 09:15:46,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:15:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 245 transitions. [2024-10-14 09:15:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:46,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:46,591 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:46,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 09:15:46,795 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-14 09:15:46,796 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:46,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:46,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2093836192, now seen corresponding path program 1 times [2024-10-14 09:15:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:15:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88601624] [2024-10-14 09:15:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:46,797 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-14 09:15:46,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:15:46,800 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-14 09:15:46,801 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-14 09:15:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:47,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 09:15:47,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1199 proven. 159 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-14 09:15:47,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:15:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 2451 trivial. 0 not checked. [2024-10-14 09:15:48,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:15:48,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88601624] [2024-10-14 09:15:48,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88601624] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:15:48,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:15:48,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-10-14 09:15:48,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275030050] [2024-10-14 09:15:48,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:15:48,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 09:15:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:15:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 09:15:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-14 09:15:48,104 INFO L87 Difference]: Start difference. First operand 155 states and 245 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-10-14 09:15:49,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:49,183 INFO L93 Difference]: Finished difference Result 378 states and 569 transitions. [2024-10-14 09:15:49,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-14 09:15:49,184 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 231 [2024-10-14 09:15:49,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:49,186 INFO L225 Difference]: With dead ends: 378 [2024-10-14 09:15:49,186 INFO L226 Difference]: Without dead ends: 287 [2024-10-14 09:15:49,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 450 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-14 09:15:49,188 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 261 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:49,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 615 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 09:15:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-10-14 09:15:49,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 267. [2024-10-14 09:15:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 146 states have (on average 1.2465753424657535) internal successors, (182), 146 states have internal predecessors, (182), 111 states have call successors, (111), 9 states have call predecessors, (111), 9 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-14 09:15:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 404 transitions. [2024-10-14 09:15:49,214 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 404 transitions. Word has length 231 [2024-10-14 09:15:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:49,214 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 404 transitions. [2024-10-14 09:15:49,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (66), 3 states have call predecessors, (66), 7 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-10-14 09:15:49,215 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 404 transitions. [2024-10-14 09:15:49,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:49,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:49,217 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:49,228 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-14 09:15:49,417 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-14 09:15:49,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:49,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:49,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1874981474, now seen corresponding path program 1 times [2024-10-14 09:15:49,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:15:49,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1576047837] [2024-10-14 09:15:49,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:49,419 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-14 09:15:49,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:15:49,421 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-14 09:15:49,422 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-14 09:15:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:49,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:15:49,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1368 proven. 54 refuted. 0 times theorem prover too weak. 1242 trivial. 0 not checked. [2024-10-14 09:15:49,845 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:15:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-10-14 09:15:50,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:15:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1576047837] [2024-10-14 09:15:50,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1576047837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:15:50,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:15:50,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 09:15:50,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478729867] [2024-10-14 09:15:50,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:15:50,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:15:50,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:15:50,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:15:50,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:15:50,047 INFO L87 Difference]: Start difference. First operand 267 states and 404 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-10-14 09:15:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:15:50,672 INFO L93 Difference]: Finished difference Result 492 states and 729 transitions. [2024-10-14 09:15:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:15:50,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 231 [2024-10-14 09:15:50,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:15:50,680 INFO L225 Difference]: With dead ends: 492 [2024-10-14 09:15:50,681 INFO L226 Difference]: Without dead ends: 297 [2024-10-14 09:15:50,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 454 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-14 09:15:50,685 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 95 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:15:50,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 222 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 09:15:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-10-14 09:15:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 279. [2024-10-14 09:15:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 155 states have (on average 1.206451612903226) internal successors, (187), 155 states have internal predecessors, (187), 111 states have call successors, (111), 12 states have call predecessors, (111), 12 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-14 09:15:50,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 409 transitions. [2024-10-14 09:15:50,726 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 409 transitions. Word has length 231 [2024-10-14 09:15:50,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:15:50,727 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 409 transitions. [2024-10-14 09:15:50,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-10-14 09:15:50,727 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 409 transitions. [2024-10-14 09:15:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:15:50,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:15:50,731 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:15:50,744 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 (6)] Ended with exit code 0 [2024-10-14 09:15:50,935 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-14 09:15:50,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:15:50,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:15:50,937 INFO L85 PathProgramCache]: Analyzing trace with hash 644978460, now seen corresponding path program 1 times [2024-10-14 09:15:50,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:15:50,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238136937] [2024-10-14 09:15:50,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:50,938 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-14 09:15:50,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:15:50,943 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-14 09:15:50,944 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-14 09:15:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:51,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 09:15:51,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-10-14 09:15:52,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:15:52,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:15:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238136937] [2024-10-14 09:15:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1238136937] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:15:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [924745761] [2024-10-14 09:15:52,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:15:52,379 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 09:15:52,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 09:15:52,384 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 09:15:52,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-14 09:15:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:15:52,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 137 conjuncts are in the unsatisfiable core [2024-10-14 09:15:52,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:15:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:15:57,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:15:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [924745761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:15:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:15:57,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-10-14 09:15:57,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533022389] [2024-10-14 09:15:57,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:15:57,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:15:57,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:15:57,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:15:57,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-14 09:15:57,856 INFO L87 Difference]: Start difference. First operand 279 states and 409 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:00,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:16:00,453 INFO L93 Difference]: Finished difference Result 545 states and 801 transitions. [2024-10-14 09:16:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:16:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 231 [2024-10-14 09:16:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:16:00,459 INFO L225 Difference]: With dead ends: 545 [2024-10-14 09:16:00,459 INFO L226 Difference]: Without dead ends: 342 [2024-10-14 09:16:00,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 474 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-14 09:16:00,461 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 113 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:16:00,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 540 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 09:16:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-14 09:16:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 293. [2024-10-14 09:16:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 169 states have (on average 1.2307692307692308) internal successors, (208), 169 states have internal predecessors, (208), 111 states have call successors, (111), 12 states have call predecessors, (111), 12 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-14 09:16:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 430 transitions. [2024-10-14 09:16:00,488 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 430 transitions. Word has length 231 [2024-10-14 09:16:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:16:00,488 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 430 transitions. [2024-10-14 09:16:00,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 430 transitions. [2024-10-14 09:16:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:16:00,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:16:00,491 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:16:00,502 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 (7)] Forceful destruction successful, exit code 0 [2024-10-14 09:16:00,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-10-14 09:16:00,895 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 09:16:00,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:16:00,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:16:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 222276634, now seen corresponding path program 1 times [2024-10-14 09:16:00,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:16:00,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950725245] [2024-10-14 09:16:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:00,897 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-14 09:16:00,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:16:00,899 INFO L229 MonitoredProcess]: Starting monitored process 9 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-14 09:16:00,900 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 (9)] Waiting until timeout for monitored process [2024-10-14 09:16:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:01,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 09:16:01,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:16:02,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-10-14 09:16:02,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:16:02,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:16:02,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950725245] [2024-10-14 09:16:02,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950725245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:16:02,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [883939159] [2024-10-14 09:16:02,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:02,387 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 09:16:02,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 09:16:02,391 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 09:16:02,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-10-14 09:16:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:02,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 138 conjuncts are in the unsatisfiable core [2024-10-14 09:16:02,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:16:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:16:07,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:16:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [883939159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:16:07,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:16:07,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-14 09:16:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458627877] [2024-10-14 09:16:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:16:07,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:16:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:16:07,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:16:07,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-14 09:16:07,277 INFO L87 Difference]: Start difference. First operand 293 states and 430 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:16:08,733 INFO L93 Difference]: Finished difference Result 577 states and 842 transitions. [2024-10-14 09:16:08,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:16:08,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 231 [2024-10-14 09:16:08,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:16:08,736 INFO L225 Difference]: With dead ends: 577 [2024-10-14 09:16:08,740 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 09:16:08,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-10-14 09:16:08,744 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 150 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:16:08,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 579 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 09:16:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 09:16:08,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 293. [2024-10-14 09:16:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 169 states have (on average 1.2307692307692308) internal successors, (208), 169 states have internal predecessors, (208), 111 states have call successors, (111), 12 states have call predecessors, (111), 12 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-14 09:16:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 430 transitions. [2024-10-14 09:16:08,788 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 430 transitions. Word has length 231 [2024-10-14 09:16:08,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:16:08,788 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 430 transitions. [2024-10-14 09:16:08,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 430 transitions. [2024-10-14 09:16:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-14 09:16:08,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:16:08,790 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:16:08,803 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 (9)] Ended with exit code 0 [2024-10-14 09:16:09,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-10-14 09:16:09,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 09:16:09,199 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:16:09,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:16:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1844550502, now seen corresponding path program 1 times [2024-10-14 09:16:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:16:09,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111258741] [2024-10-14 09:16:09,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:09,201 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-14 09:16:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:16:09,202 INFO L229 MonitoredProcess]: Starting monitored process 11 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-14 09:16:09,205 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 (11)] Waiting until timeout for monitored process [2024-10-14 09:16:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:09,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:16:09,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:16:10,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:16:10,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:16:10,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:16:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111258741] [2024-10-14 09:16:10,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111258741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:16:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:16:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:16:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781404773] [2024-10-14 09:16:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:16:10,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:16:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:16:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:16:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:16:10,131 INFO L87 Difference]: Start difference. First operand 293 states and 430 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:16:10,943 INFO L93 Difference]: Finished difference Result 697 states and 1025 transitions. [2024-10-14 09:16:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:16:10,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 231 [2024-10-14 09:16:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:16:10,953 INFO L225 Difference]: With dead ends: 697 [2024-10-14 09:16:10,953 INFO L226 Difference]: Without dead ends: 485 [2024-10-14 09:16:10,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 227 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-14 09:16:10,954 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 214 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:16:10,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 507 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 09:16:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-14 09:16:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 390. [2024-10-14 09:16:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 225 states have (on average 1.2222222222222223) internal successors, (275), 225 states have internal predecessors, (275), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-14 09:16:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 571 transitions. [2024-10-14 09:16:10,988 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 571 transitions. Word has length 231 [2024-10-14 09:16:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:16:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 571 transitions. [2024-10-14 09:16:10,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:10,989 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 571 transitions. [2024-10-14 09:16:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-14 09:16:10,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:16:10,990 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:16:11,002 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 (11)] Ended with exit code 0 [2024-10-14 09:16:11,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-14 09:16:11,191 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:16:11,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:16:11,192 INFO L85 PathProgramCache]: Analyzing trace with hash 494982076, now seen corresponding path program 1 times [2024-10-14 09:16:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:16:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164628579] [2024-10-14 09:16:11,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:11,192 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-14 09:16:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:16:11,194 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-14 09:16:11,195 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-14 09:16:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:11,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 09:16:11,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:16:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-10-14 09:16:12,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:16:12,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:16:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164628579] [2024-10-14 09:16:12,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164628579] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:16:12,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [755451733] [2024-10-14 09:16:12,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:12,557 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 09:16:12,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 09:16:12,559 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 09:16:12,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2024-10-14 09:16:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:12,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 153 conjuncts are in the unsatisfiable core [2024-10-14 09:16:12,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:16:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:16:18,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:16:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [755451733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:16:18,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:16:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2024-10-14 09:16:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161703785] [2024-10-14 09:16:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:16:18,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:16:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:16:18,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:16:18,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-14 09:16:18,062 INFO L87 Difference]: Start difference. First operand 390 states and 571 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:16:19,537 INFO L93 Difference]: Finished difference Result 640 states and 933 transitions. [2024-10-14 09:16:19,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:16:19,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 232 [2024-10-14 09:16:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:16:19,544 INFO L225 Difference]: With dead ends: 640 [2024-10-14 09:16:19,544 INFO L226 Difference]: Without dead ends: 436 [2024-10-14 09:16:19,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:16:19,546 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 161 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 09:16:19,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 452 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 09:16:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-14 09:16:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 393. [2024-10-14 09:16:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 228 states have (on average 1.2236842105263157) internal successors, (279), 228 states have internal predecessors, (279), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-14 09:16:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 575 transitions. [2024-10-14 09:16:19,580 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 575 transitions. Word has length 232 [2024-10-14 09:16:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:16:19,580 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 575 transitions. [2024-10-14 09:16:19,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:19,581 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 575 transitions. [2024-10-14 09:16:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-14 09:16:19,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:16:19,582 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:16:19,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2024-10-14 09:16:19,797 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 (12)] Forceful destruction successful, exit code 0 [2024-10-14 09:16:19,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt,12 /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-14 09:16:19,986 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:16:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:16:19,986 INFO L85 PathProgramCache]: Analyzing trace with hash 276127358, now seen corresponding path program 1 times [2024-10-14 09:16:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:16:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978785532] [2024-10-14 09:16:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:19,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-14 09:16:19,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:16:19,990 INFO L229 MonitoredProcess]: Starting monitored process 14 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-14 09:16:19,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 (14)] Waiting until timeout for monitored process [2024-10-14 09:16:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:20,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 09:16:20,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:16:20,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 312 proven. 102 refuted. 0 times theorem prover too weak. 2250 trivial. 0 not checked. [2024-10-14 09:16:20,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:16:21,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:16:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978785532] [2024-10-14 09:16:21,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978785532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:16:21,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [2096961839] [2024-10-14 09:16:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:21,180 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 09:16:21,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 09:16:21,181 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 09:16:21,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-10-14 09:16:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:21,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 154 conjuncts are in the unsatisfiable core [2024-10-14 09:16:21,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:16:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-10-14 09:16:26,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:16:26,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [2096961839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:16:26,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:16:26,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-10-14 09:16:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167261548] [2024-10-14 09:16:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:16:26,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:16:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:16:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:16:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-14 09:16:26,682 INFO L87 Difference]: Start difference. First operand 393 states and 575 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:16:28,058 INFO L93 Difference]: Finished difference Result 561 states and 816 transitions. [2024-10-14 09:16:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:16:28,059 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 232 [2024-10-14 09:16:28,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:16:28,061 INFO L225 Difference]: With dead ends: 561 [2024-10-14 09:16:28,062 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 09:16:28,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2024-10-14 09:16:28,063 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 210 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:16:28,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 553 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 09:16:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 09:16:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 395. [2024-10-14 09:16:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 230 states have (on average 1.2217391304347827) internal successors, (281), 230 states have internal predecessors, (281), 148 states have call successors, (148), 16 states have call predecessors, (148), 16 states have return successors, (148), 148 states have call predecessors, (148), 148 states have call successors, (148) [2024-10-14 09:16:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 577 transitions. [2024-10-14 09:16:28,096 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 577 transitions. Word has length 232 [2024-10-14 09:16:28,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:16:28,096 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 577 transitions. [2024-10-14 09:16:28,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-10-14 09:16:28,097 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 577 transitions. [2024-10-14 09:16:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-10-14 09:16:28,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:16:28,098 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 09:16:28,108 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 (14)] Ended with exit code 0 [2024-10-14 09:16:28,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-10-14 09:16:28,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 09:16:28,505 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:16:28,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:16:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2144976064, now seen corresponding path program 1 times [2024-10-14 09:16:28,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:16:28,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983619052] [2024-10-14 09:16:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:16:28,506 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-14 09:16:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:16:28,509 INFO L229 MonitoredProcess]: Starting monitored process 16 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-14 09:16:28,510 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 (16)] Waiting until timeout for monitored process [2024-10-14 09:16:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:16:28,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-14 09:16:28,805 INFO L278 TraceCheckSpWp]: Computing forward predicates...