./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_fillercodesize_ps-cn-25_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:25:53,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:25:53,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:25:53,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:25:53,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:25:53,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:25:53,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:25:53,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:25:53,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:25:53,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:25:53,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:25:53,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:25:53,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:25:53,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:25:53,277 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:25:53,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:25:53,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:25:53,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:25:53,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:25:53,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:25:53,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:25:53,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:25:53,280 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:25:53,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:25:53,280 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:25:53,281 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:25:53,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:25:53,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:25:53,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:25:53,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:25:53,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:25:53,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:25:53,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:25:53,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:25:53,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:25:53,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:25:53,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:25:53,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:25:53,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:25:53,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:25:53,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:25:53,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:25:53,284 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-clean/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-clean/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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2024-10-11 08:25:53,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:25:53,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:25:53,553 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:25:53,554 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:25:53,555 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:25:53,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-11 08:25:55,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:25:55,233 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:25:55,236 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-11 08:25:55,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/def022659/49ffa836a93049478c5a9d4cde9875b6/FLAG1f793e350 [2024-10-11 08:25:55,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/def022659/49ffa836a93049478c5a9d4cde9875b6 [2024-10-11 08:25:55,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:25:55,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:25:55,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:25:55,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:25:55,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:25:55,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:55,605 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b831dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55, skipping insertion in model container [2024-10-11 08:25:55,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:55,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:25:55,754 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-11 08:25:55,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:25:55,817 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:25:55,826 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-11 08:25:55,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:25:55,963 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:25:55,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55 WrapperNode [2024-10-11 08:25:55,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:25:55,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:25:55,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:25:55,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:25:55,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,066 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-10-11 08:25:56,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:25:56,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:25:56,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:25:56,070 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:25:56,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,133 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-11 08:25:56,138 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,164 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:25:56,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:25:56,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:25:56,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:25:56,197 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (1/1) ... [2024-10-11 08:25:56,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:25:56,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:25:56,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:25:56,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:25:56,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:25:56,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:25:56,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:25:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:25:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:25:56,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:25:56,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:25:56,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:25:56,656 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-11 08:25:56,656 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:25:56,703 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:25:56,704 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:25:56,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:56 BoogieIcfgContainer [2024-10-11 08:25:56,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:25:56,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:25:56,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:25:56,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:25:56,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:25:55" (1/3) ... [2024-10-11 08:25:56,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a434fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:56, skipping insertion in model container [2024-10-11 08:25:56,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:55" (2/3) ... [2024-10-11 08:25:56,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a434fe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:56, skipping insertion in model container [2024-10-11 08:25:56,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:56" (3/3) ... [2024-10-11 08:25:56,714 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-11 08:25:56,728 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:25:56,728 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:25:56,777 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:25:56,783 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;@3ddddb8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:25:56,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:25:56,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 08:25:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 08:25:56,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:56,805 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:25:56,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash 258799246, now seen corresponding path program 1 times [2024-10-11 08:25:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70109398] [2024-10-11 08:25:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:25:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:25:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:25:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:25:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:25:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:25:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:25:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:25:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:25:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:25:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:25:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:25:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:25:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:25:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:25:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:25:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:25:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:25:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:25:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:25:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 08:25:57,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:25:57,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70109398] [2024-10-11 08:25:57,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70109398] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:57,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:57,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:25:57,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279461500] [2024-10-11 08:25:57,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:57,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:25:57,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:57,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:25:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:25:57,381 INFO L87 Difference]: Start difference. First operand has 89 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:25:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:57,429 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2024-10-11 08:25:57,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:25:57,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-10-11 08:25:57,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:57,441 INFO L225 Difference]: With dead ends: 175 [2024-10-11 08:25:57,441 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 08:25:57,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-11 08:25:57,449 INFO L432 NwaCegarLoop]: 133 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, 133 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-11 08:25:57,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:25:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 08:25:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 08:25:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 08:25:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-10-11 08:25:57,501 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 197 [2024-10-11 08:25:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:57,501 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-10-11 08:25:57,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:25:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-10-11 08:25:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 08:25:57,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:57,505 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:25:57,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:25:57,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1884942792, now seen corresponding path program 1 times [2024-10-11 08:25:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994216519] [2024-10-11 08:25:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:25:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:25:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:25:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:25:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:25:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:25:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:25:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:57,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:25:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:25:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:25:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:25:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:25:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:25:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:25:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:25:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:25:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:25:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:25:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:25:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:25:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 08:25:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:25:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:58,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994216519] [2024-10-11 08:25:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994216519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:25:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592220373] [2024-10-11 08:25:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:58,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:25:58,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:58,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:25:58,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:25:58,089 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:25:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:58,284 INFO L93 Difference]: Finished difference Result 260 states and 407 transitions. [2024-10-11 08:25:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:25:58,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-11 08:25:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:58,288 INFO L225 Difference]: With dead ends: 260 [2024-10-11 08:25:58,288 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 08:25:58,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-11 08:25:58,295 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:58,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 393 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:25:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 08:25:58,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2024-10-11 08:25:58,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 08:25:58,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 241 transitions. [2024-10-11 08:25:58,320 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 241 transitions. Word has length 197 [2024-10-11 08:25:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:58,321 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 241 transitions. [2024-10-11 08:25:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:25:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 241 transitions. [2024-10-11 08:25:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:25:58,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:58,324 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:25:58,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:25:58,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:58,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1930462375, now seen corresponding path program 1 times [2024-10-11 08:25:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:58,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28797462] [2024-10-11 08:25:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:25:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:25:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:25:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:25:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:25:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:25:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:25:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:25:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:25:58,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:25:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:25:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:25:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:25:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:25:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:25:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:25:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:25:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:25:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:25:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:25:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 08:25:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:58,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:25:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28797462] [2024-10-11 08:25:58,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28797462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:58,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:25:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956847981] [2024-10-11 08:25:58,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:58,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:25:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:58,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:25:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:25:58,796 INFO L87 Difference]: Start difference. First operand 154 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:25:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:59,102 INFO L93 Difference]: Finished difference Result 369 states and 577 transitions. [2024-10-11 08:25:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:25:59,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-11 08:25:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:59,110 INFO L225 Difference]: With dead ends: 369 [2024-10-11 08:25:59,113 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 08:25:59,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 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-11 08:25:59,115 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 138 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:59,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 516 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:25:59,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 08:25:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 238. [2024-10-11 08:25:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-11 08:25:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 374 transitions. [2024-10-11 08:25:59,166 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 374 transitions. Word has length 198 [2024-10-11 08:25:59,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:59,167 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 374 transitions. [2024-10-11 08:25:59,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:25:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 374 transitions. [2024-10-11 08:25:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:25:59,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:59,170 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:25:59,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:25:59,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:59,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash 919345125, now seen corresponding path program 1 times [2024-10-11 08:25:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888624274] [2024-10-11 08:25:59,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:25:59,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:25:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:25:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:25:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:25:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:25:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:25:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:25:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:25:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:25:59,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:25:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:25:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:25:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:25:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:25:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:25:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:25:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:25:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:25:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:25:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 08:25:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:25:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888624274] [2024-10-11 08:25:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888624274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:59,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:59,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:25:59,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79867654] [2024-10-11 08:25:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:59,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:25:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:59,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:25:59,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:25:59,496 INFO L87 Difference]: Start difference. First operand 238 states and 374 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:25:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:59,578 INFO L93 Difference]: Finished difference Result 548 states and 857 transitions. [2024-10-11 08:25:59,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:25:59,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-11 08:25:59,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:59,585 INFO L225 Difference]: With dead ends: 548 [2024-10-11 08:25:59,586 INFO L226 Difference]: Without dead ends: 376 [2024-10-11 08:25:59,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-11 08:25:59,589 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 100 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:59,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 251 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:25:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-11 08:25:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2024-10-11 08:25:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 222 states have (on average 1.3288288288288288) internal successors, (295), 224 states have internal predecessors, (295), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-11 08:25:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 581 transitions. [2024-10-11 08:25:59,667 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 581 transitions. Word has length 198 [2024-10-11 08:25:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:59,667 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 581 transitions. [2024-10-11 08:25:59,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:25:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 581 transitions. [2024-10-11 08:25:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:25:59,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:59,670 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:25:59,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:25:59,670 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:59,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash -669002777, now seen corresponding path program 1 times [2024-10-11 08:25:59,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:59,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951478962] [2024-10-11 08:25:59,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:26:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:26:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:26:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:26:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:26:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:26:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:26:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:26:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:26:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:26:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:26:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:26:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:26:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 08:26:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:26:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 08:26:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:26:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 08:26:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:26:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 08:26:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:26:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 08:26:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:26:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 08:26:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:26:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 08:26:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:26:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 08:26:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:26:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 08:26:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 08:26:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2024-10-11 08:26:00,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:26:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951478962] [2024-10-11 08:26:00,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951478962] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:00,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298764349] [2024-10-11 08:26:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:00,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:26:00,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:26:00,361 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:26:00,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:26:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:00,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 08:26:00,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:01,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 947 proven. 123 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2024-10-11 08:26:01,149 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-10-11 08:26:01,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298764349] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:26:01,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:26:01,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-11 08:26:01,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686111344] [2024-10-11 08:26:01,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:26:01,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 08:26:01,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:26:01,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 08:26:01,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:26:01,683 INFO L87 Difference]: Start difference. First operand 372 states and 581 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-11 08:26:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:02,758 INFO L93 Difference]: Finished difference Result 1138 states and 1678 transitions. [2024-10-11 08:26:02,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-11 08:26:02,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 198 [2024-10-11 08:26:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:02,769 INFO L225 Difference]: With dead ends: 1138 [2024-10-11 08:26:02,769 INFO L226 Difference]: Without dead ends: 989 [2024-10-11 08:26:02,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 451 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-11 08:26:02,771 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 518 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:02,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 681 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:26:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-10-11 08:26:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 593. [2024-10-11 08:26:02,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 371 states have (on average 1.3018867924528301) internal successors, (483), 374 states have internal predecessors, (483), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199) [2024-10-11 08:26:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 881 transitions. [2024-10-11 08:26:02,907 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 881 transitions. Word has length 198 [2024-10-11 08:26:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 881 transitions. [2024-10-11 08:26:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-11 08:26:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 881 transitions. [2024-10-11 08:26:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:26:02,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:02,910 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:02,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:26:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:26:03,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1255808791, now seen corresponding path program 1 times [2024-10-11 08:26:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:26:03,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637520673] [2024-10-11 08:26:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:03,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:26:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:26:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1876940591] [2024-10-11 08:26:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:03,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:26:03,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:26:03,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:26:03,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:26:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:03,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 08:26:03,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 288 proven. 162 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-11 08:26:04,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:26:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637520673] [2024-10-11 08:26:05,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:26:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876940591] [2024-10-11 08:26:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876940591] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:05,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:26:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-11 08:26:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374044677] [2024-10-11 08:26:05,518 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 08:26:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 08:26:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:26:05,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 08:26:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=238, Unknown=5, NotChecked=0, Total=342 [2024-10-11 08:26:05,520 INFO L87 Difference]: Start difference. First operand 593 states and 881 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 08:26:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:06,292 INFO L93 Difference]: Finished difference Result 1722 states and 2480 transitions. [2024-10-11 08:26:06,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 08:26:06,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 198 [2024-10-11 08:26:06,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:06,303 INFO L225 Difference]: With dead ends: 1722 [2024-10-11 08:26:06,305 INFO L226 Difference]: Without dead ends: 1396 [2024-10-11 08:26:06,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=727, Unknown=5, NotChecked=0, Total=1056 [2024-10-11 08:26:06,308 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 163 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:06,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 902 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 08:26:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-11 08:26:06,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1226. [2024-10-11 08:26:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 792 states have (on average 1.2916666666666667) internal successors, (1023), 802 states have internal predecessors, (1023), 375 states have call successors, (375), 58 states have call predecessors, (375), 58 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2024-10-11 08:26:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1773 transitions. [2024-10-11 08:26:06,451 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1773 transitions. Word has length 198 [2024-10-11 08:26:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:06,453 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1773 transitions. [2024-10-11 08:26:06,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 08:26:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1773 transitions. [2024-10-11 08:26:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 08:26:06,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:06,456 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:06,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:26:06,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:26:06,661 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:06,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:06,662 INFO L85 PathProgramCache]: Analyzing trace with hash -997643353, now seen corresponding path program 1 times [2024-10-11 08:26:06,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:26:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898006692] [2024-10-11 08:26:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:06,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:26:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:26:06,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [974144612] [2024-10-11 08:26:06,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:06,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:26:06,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:26:06,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:26:06,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 08:26:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:06,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 08:26:06,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-11 08:26:08,612 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:09,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:26:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898006692] [2024-10-11 08:26:09,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:26:09,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974144612] [2024-10-11 08:26:09,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974144612] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:09,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:26:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 08:26:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075374401] [2024-10-11 08:26:09,230 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 08:26:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 08:26:09,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:26:09,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 08:26:09,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-11 08:26:09,233 INFO L87 Difference]: Start difference. First operand 1226 states and 1773 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:26:10,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:10,366 INFO L93 Difference]: Finished difference Result 2351 states and 3406 transitions. [2024-10-11 08:26:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 08:26:10,370 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2024-10-11 08:26:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:10,381 INFO L225 Difference]: With dead ends: 2351 [2024-10-11 08:26:10,381 INFO L226 Difference]: Without dead ends: 1854 [2024-10-11 08:26:10,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-11 08:26:10,385 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 134 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 74 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:10,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 949 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 630 Invalid, 6 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:26:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-10-11 08:26:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1582. [2024-10-11 08:26:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1016 states have (on average 1.280511811023622) internal successors, (1301), 1028 states have internal predecessors, (1301), 487 states have call successors, (487), 78 states have call predecessors, (487), 78 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2024-10-11 08:26:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2275 transitions. [2024-10-11 08:26:10,568 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2275 transitions. Word has length 198 [2024-10-11 08:26:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:10,568 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2275 transitions. [2024-10-11 08:26:10,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:26:10,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2275 transitions. [2024-10-11 08:26:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 08:26:10,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:10,571 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:10,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:26:10,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:26:10,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:10,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 914456943, now seen corresponding path program 1 times [2024-10-11 08:26:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:26:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417473840] [2024-10-11 08:26:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:26:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:26:10,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [919015858] [2024-10-11 08:26:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:26:10,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:26:10,926 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:26:10,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 08:26:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:26:11,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:26:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:26:11,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:26:11,235 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:26:11,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:26:11,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 08:26:11,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 08:26:11,474 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:26:11,602 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:26:11,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:26:11 BoogieIcfgContainer [2024-10-11 08:26:11,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:26:11,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:26:11,609 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:26:11,610 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:26:11,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:56" (3/4) ... [2024-10-11 08:26:11,612 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:26:11,613 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:26:11,613 INFO L158 Benchmark]: Toolchain (without parser) took 16016.11ms. Allocated memory was 159.4MB in the beginning and 501.2MB in the end (delta: 341.8MB). Free memory was 86.0MB in the beginning and 439.7MB in the end (delta: -353.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:26:11,614 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:26:11,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.68ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 85.9MB in the beginning and 226.0MB in the end (delta: -140.2MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2024-10-11 08:26:11,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.66ms. Allocated memory is still 255.9MB. Free memory was 226.0MB in the beginning and 221.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:26:11,614 INFO L158 Benchmark]: Boogie Preprocessor took 125.43ms. Allocated memory is still 255.9MB. Free memory was 221.9MB in the beginning and 215.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 08:26:11,614 INFO L158 Benchmark]: RCFGBuilder took 510.33ms. Allocated memory is still 255.9MB. Free memory was 215.2MB in the beginning and 184.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 08:26:11,615 INFO L158 Benchmark]: TraceAbstraction took 14901.19ms. Allocated memory was 255.9MB in the beginning and 501.2MB in the end (delta: 245.4MB). Free memory was 184.1MB in the beginning and 440.8MB in the end (delta: -256.7MB). Peak memory consumption was 256.1MB. Max. memory is 16.1GB. [2024-10-11 08:26:11,615 INFO L158 Benchmark]: Witness Printer took 3.64ms. Allocated memory is still 501.2MB. Free memory was 440.8MB in the beginning and 439.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:26:11,616 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.15ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.68ms. Allocated memory was 159.4MB in the beginning and 255.9MB in the end (delta: 96.5MB). Free memory was 85.9MB in the beginning and 226.0MB in the end (delta: -140.2MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.66ms. Allocated memory is still 255.9MB. Free memory was 226.0MB in the beginning and 221.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 125.43ms. Allocated memory is still 255.9MB. Free memory was 221.9MB in the beginning and 215.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 510.33ms. Allocated memory is still 255.9MB. Free memory was 215.2MB in the beginning and 184.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14901.19ms. Allocated memory was 255.9MB in the beginning and 501.2MB in the end (delta: 245.4MB). Free memory was 184.1MB in the beginning and 440.8MB in the end (delta: -256.7MB). Peak memory consumption was 256.1MB. Max. memory is 16.1GB. * Witness Printer took 3.64ms. Allocated memory is still 501.2MB. Free memory was 440.8MB in the beginning and 439.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 186, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 69. 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] unsigned long int var_1_28 = 10; [L44] signed short int var_1_29 = -256; [L45] signed char var_1_30 = 1; [L46] float var_1_31 = 7.8; [L47] float var_1_32 = 63.25; [L48] float var_1_33 = 0.4; [L49] float var_1_34 = 64.875; [L50] float var_1_35 = 1.3; [L51] unsigned short int var_1_36 = 100; [L52] signed short int last_1_var_1_1 = 16; [L53] unsigned char last_1_var_1_6 = 10; [L54] unsigned char last_1_var_1_8 = 1; [L55] signed short int last_1_var_1_13 = 200; [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_1 = var_1_1 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_8 = var_1_8 [L183] last_1_var_1_13 = var_1_13 [L193] RET updateLastVariables() [L194] CALL updateVariables() [L129] var_1_5 = __VERIFIER_nondet_char() [L130] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L130] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L131] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L131] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L132] var_1_7 = __VERIFIER_nondet_uchar() [L133] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L133] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L134] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L134] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L136] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L137] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L137] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L139] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L140] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L140] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L141] var_1_15 = __VERIFIER_nondet_float() [L142] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L142] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L143] var_1_16 = __VERIFIER_nondet_float() [L144] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L144] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L146] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L147] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L147] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L148] var_1_22 = __VERIFIER_nondet_uchar() [L149] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L149] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L150] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L150] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L152] 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=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L153] 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=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L153] 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=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L154] var_1_24 = __VERIFIER_nondet_short() [L155] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L155] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L156] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L156] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L158] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L159] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L159] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L160] var_1_27 = __VERIFIER_nondet_long() [L161] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L161] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L162] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L162] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L163] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L163] 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L164] var_1_29 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_29 >= -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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L165] RET assume_abort_if_not(var_1_29 >= -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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L166] CALL assume_abort_if_not(var_1_29 <= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L166] RET assume_abort_if_not(var_1_29 <= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L167] var_1_30 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_30 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L168] RET assume_abort_if_not(var_1_30 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_30 <= 16) 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L169] RET assume_abort_if_not(var_1_30 <= 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_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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L170] var_1_32 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L171] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L172] var_1_33 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L173] RET assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L174] var_1_34 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L175] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L176] var_1_35 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 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=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L194] RET updateVariables() [L195] CALL step() [L59] COND TRUE var_1_22 || var_1_23 [L60] 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, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L62] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L63] var_1_26 = 8.5f VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] EXPR var_1_29 >> var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] EXPR ((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] COND TRUE var_1_24 > ((((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)))) [L66] var_1_28 = var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L68] COND TRUE var_1_27 > var_1_28 [L69] var_1_31 = (((((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) > (var_1_35)) ? ((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) : (var_1_35))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L73] COND FALSE !(((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) < var_1_30) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L76] signed long int stepLocal_6 = last_1_var_1_1; [L77] 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=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L78] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L79] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L82] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L87] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L90] COND TRUE var_1_5 >= -2 [L91] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L93] unsigned char stepLocal_4 = var_1_6; [L94] 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=27, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L95] 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=27, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L96] 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))) [L97] 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=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L104] 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=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L105] 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=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L108] 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=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L109] COND TRUE \read(var_1_19) [L110] 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=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L116] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L117] 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=27, stepLocal_1=383, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L118] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L125] 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=27, stepLocal_1=383, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] 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) ; [L196] RET, EXPR property() [L196] 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=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, 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=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.7s, OverallIterations: 8, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1195 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1162 mSDsluCounter, 3825 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2823 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2037 IncrementalHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 1002 mSDtfsCounter, 2037 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1580 GetRequests, 1467 SyntacticMatches, 3 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1582occurred in iteration=7, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 7 MinimizatonAttempts, 907 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2376 NumberOfCodeBlocks, 2376 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1771 ConstructedInterpolants, 1 QuantifiedInterpolants, 11567 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1380 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 16122/16740 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-11 08:26:11,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:26:13,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:26:13,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:26:13,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:26:13,827 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:26:13,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:26:13,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:26:13,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:26:13,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:26:13,857 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:26:13,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:26:13,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:26:13,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:26:13,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:26:13,861 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:26:13,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:26:13,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:26:13,862 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:26:13,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:26:13,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:26:13,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:26:13,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:26:13,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:26:13,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:26:13,864 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:26:13,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:26:13,864 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:26:13,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:26:13,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:26:13,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:26:13,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:26:13,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:26:13,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:26:13,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:26:13,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:26:13,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:26:13,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:26:13,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:26:13,867 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:26:13,868 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:26:13,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:26:13,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:26:13,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:26:13,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:26:13,869 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:26:13,869 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-clean/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-clean/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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2024-10-11 08:26:14,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:26:14,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:26:14,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:26:14,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:26:14,195 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:26:14,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-11 08:26:15,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:26:15,940 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:26:15,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-11 08:26:15,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54a72a129/d54e538857af40d19b7925352dd08c06/FLAG507dd3002 [2024-10-11 08:26:16,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54a72a129/d54e538857af40d19b7925352dd08c06 [2024-10-11 08:26:16,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:26:16,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:26:16,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:26:16,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:26:16,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:26:16,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b8b418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16, skipping insertion in model container [2024-10-11 08:26:16,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,332 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:26:16,472 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-11 08:26:16,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:26:16,559 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:26:16,570 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_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-11 08:26:16,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:26:16,625 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:26:16,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16 WrapperNode [2024-10-11 08:26:16,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:26:16,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:26:16,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:26:16,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:26:16,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,675 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-11 08:26:16,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:26:16,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:26:16,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:26:16,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:26:16,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,711 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-11 08:26:16,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,712 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:26:16,732 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:26:16,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:26:16,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:26:16,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (1/1) ... [2024-10-11 08:26:16,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:26:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:26:16,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:26:16,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:26:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:26:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:26:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:26:16,827 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:26:16,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:26:16,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:26:16,915 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:26:16,916 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:26:17,449 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 08:26:17,449 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:26:17,523 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:26:17,524 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:26:17,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:26:17 BoogieIcfgContainer [2024-10-11 08:26:17,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:26:17,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:26:17,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:26:17,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:26:17,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:26:16" (1/3) ... [2024-10-11 08:26:17,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d967b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:26:17, skipping insertion in model container [2024-10-11 08:26:17,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:26:16" (2/3) ... [2024-10-11 08:26:17,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d967b26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:26:17, skipping insertion in model container [2024-10-11 08:26:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:26:17" (3/3) ... [2024-10-11 08:26:17,543 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-11 08:26:17,575 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:26:17,575 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:26:17,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:26:17,671 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;@5d3fafa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:26:17,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:26:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 08:26:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 08:26:17,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:17,694 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:17,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:17,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 135550756, now seen corresponding path program 1 times [2024-10-11 08:26:17,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:17,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499478663] [2024-10-11 08:26:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:17,711 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-11 08:26:17,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:17,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 08:26:17,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:18,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 08:26:18,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 587 proven. 24 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2024-10-11 08:26:18,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:26:18,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:26:18,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499478663] [2024-10-11 08:26:18,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499478663] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:18,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:26:18,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 08:26:18,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429713368] [2024-10-11 08:26:18,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:26:18,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:26:18,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:26:18,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:26:18,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 08:26:18,716 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:18,963 INFO L93 Difference]: Finished difference Result 229 states and 425 transitions. [2024-10-11 08:26:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:26:18,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-11 08:26:18,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:18,979 INFO L225 Difference]: With dead ends: 229 [2024-10-11 08:26:18,979 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 08:26:18,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-11 08:26:18,989 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 100 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:18,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 236 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:26:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 08:26:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-10-11 08:26:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 86 states have internal predecessors, (115), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 08:26:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2024-10-11 08:26:19,056 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 195 [2024-10-11 08:26:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:19,060 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2024-10-11 08:26:19,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:19,061 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2024-10-11 08:26:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-11 08:26:19,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:19,066 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:19,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:19,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 08:26:19,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:19,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash -885517598, now seen corresponding path program 1 times [2024-10-11 08:26:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573357356] [2024-10-11 08:26:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:19,273 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-11 08:26:19,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:19,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 08:26:19,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:19,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:26:19,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:20,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:26:20,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:26:20,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:26:20,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573357356] [2024-10-11 08:26:20,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573357356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:26:20,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:26:20,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:26:20,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624964567] [2024-10-11 08:26:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:26:20,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:26:20,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:26:20,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:26:20,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:26:20,014 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:20,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:20,296 INFO L93 Difference]: Finished difference Result 394 states and 618 transitions. [2024-10-11 08:26:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:26:20,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-11 08:26:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:20,306 INFO L225 Difference]: With dead ends: 394 [2024-10-11 08:26:20,306 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 08:26:20,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 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-11 08:26:20,308 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 90 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:20,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 366 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:26:20,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 08:26:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2024-10-11 08:26:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 122 states have internal predecessors, (157), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-11 08:26:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 331 transitions. [2024-10-11 08:26:20,366 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 331 transitions. Word has length 195 [2024-10-11 08:26:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:20,366 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 331 transitions. [2024-10-11 08:26:20,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 331 transitions. [2024-10-11 08:26:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 08:26:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:20,372 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:20,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:26:20,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 08:26:20,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:20,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash -435714880, now seen corresponding path program 1 times [2024-10-11 08:26:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:20,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60043213] [2024-10-11 08:26:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:20,578 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-11 08:26:20,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:20,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 08:26:20,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:21,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 08:26:21,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:26:22,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:26:22,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:26:22,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60043213] [2024-10-11 08:26:22,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60043213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:26:22,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:26:22,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:26:22,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704860607] [2024-10-11 08:26:22,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:26:22,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:26:22,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:26:22,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:26:22,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:26:22,059 INFO L87 Difference]: Start difference. First operand 213 states and 331 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:22,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:22,766 INFO L93 Difference]: Finished difference Result 583 states and 914 transitions. [2024-10-11 08:26:22,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 08:26:22,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-11 08:26:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:22,774 INFO L225 Difference]: With dead ends: 583 [2024-10-11 08:26:22,774 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 08:26:22,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 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-11 08:26:22,776 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 119 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:22,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 480 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:26:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 08:26:22,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 354. [2024-10-11 08:26:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 206 states have internal predecessors, (268), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-11 08:26:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 554 transitions. [2024-10-11 08:26:22,862 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 554 transitions. Word has length 196 [2024-10-11 08:26:22,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 554 transitions. [2024-10-11 08:26:22,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 554 transitions. [2024-10-11 08:26:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 08:26:22,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:22,869 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:22,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:23,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-11 08:26:23,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:23,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1446832130, now seen corresponding path program 1 times [2024-10-11 08:26:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:23,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590392019] [2024-10-11 08:26:23,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:23,072 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-11 08:26:23,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:23,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-11 08:26:23,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:23,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:26:23,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:23,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:26:23,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:26:23,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:26:23,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590392019] [2024-10-11 08:26:23,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590392019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:26:23,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:26:23,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:26:23,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822328470] [2024-10-11 08:26:23,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:26:23,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:26:23,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:26:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:26:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:26:23,401 INFO L87 Difference]: Start difference. First operand 354 states and 554 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:23,539 INFO L93 Difference]: Finished difference Result 638 states and 1003 transitions. [2024-10-11 08:26:23,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:26:23,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-11 08:26:23,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:23,547 INFO L225 Difference]: With dead ends: 638 [2024-10-11 08:26:23,547 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 08:26:23,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 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-11 08:26:23,549 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 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-11 08:26:23,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:26:23,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 08:26:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 08:26:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 206 states have internal predecessors, (264), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-11 08:26:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 550 transitions. [2024-10-11 08:26:23,579 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 550 transitions. Word has length 196 [2024-10-11 08:26:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:23,579 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 550 transitions. [2024-10-11 08:26:23,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 550 transitions. [2024-10-11 08:26:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 08:26:23,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:23,581 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:23,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-11 08:26:23,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:23,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:23,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2038788540, now seen corresponding path program 1 times [2024-10-11 08:26:23,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:23,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054343293] [2024-10-11 08:26:23,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:23,787 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-11 08:26:23,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:23,792 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-11 08:26:23,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:24,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:26:24,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-11 08:26:24,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:25,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:26:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054343293] [2024-10-11 08:26:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054343293] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [821346804] [2024-10-11 08:26:25,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:25,378 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:26:25,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:26:25,380 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:26:25,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-11 08:26:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:26,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:26:26,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:26:26,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:26:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [821346804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:26:26,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:26:26,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-11 08:26:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137433378] [2024-10-11 08:26:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:26:26,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:26:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:26:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:26:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:26:26,888 INFO L87 Difference]: Start difference. First operand 354 states and 550 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:28,927 INFO L93 Difference]: Finished difference Result 903 states and 1384 transitions. [2024-10-11 08:26:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 08:26:28,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-11 08:26:28,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:28,939 INFO L225 Difference]: With dead ends: 903 [2024-10-11 08:26:28,939 INFO L226 Difference]: Without dead ends: 760 [2024-10-11 08:26:28,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:26:28,941 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 154 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:28,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 509 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 08:26:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-11 08:26:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 678. [2024-10-11 08:26:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 406 states have (on average 1.3103448275862069) internal successors, (532), 412 states have internal predecessors, (532), 259 states have call successors, (259), 12 states have call predecessors, (259), 12 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2024-10-11 08:26:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1050 transitions. [2024-10-11 08:26:29,025 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1050 transitions. Word has length 196 [2024-10-11 08:26:29,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:29,026 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1050 transitions. [2024-10-11 08:26:29,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1050 transitions. [2024-10-11 08:26:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 08:26:29,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:29,027 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:29,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:29,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-11 08:26:29,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:26:29,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:29,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1998013318, now seen corresponding path program 1 times [2024-10-11 08:26:29,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:29,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1297898202] [2024-10-11 08:26:29,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:29,430 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-11 08:26:29,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:29,431 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-11 08:26:29,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-11 08:26:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:29,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:26:29,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-11 08:26:30,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:31,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:26:31,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1297898202] [2024-10-11 08:26:31,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1297898202] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:31,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1708464427] [2024-10-11 08:26:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:31,031 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:26:31,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:26:31,034 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:26:31,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-11 08:26:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:32,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 08:26:32,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-11 08:26:32,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:26:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1708464427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:26:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 08:26:32,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-11 08:26:32,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131166370] [2024-10-11 08:26:32,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:26:32,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:26:32,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:26:32,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:26:32,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:26:32,939 INFO L87 Difference]: Start difference. First operand 678 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:34,927 INFO L93 Difference]: Finished difference Result 1155 states and 1788 transitions. [2024-10-11 08:26:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:26:34,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-11 08:26:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:34,933 INFO L225 Difference]: With dead ends: 1155 [2024-10-11 08:26:34,933 INFO L226 Difference]: Without dead ends: 871 [2024-10-11 08:26:34,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-11 08:26:34,935 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 105 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:34,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 437 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 08:26:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-11 08:26:35,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2024-10-11 08:26:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 489 states have (on average 1.3067484662576687) internal successors, (639), 496 states have internal predecessors, (639), 315 states have call successors, (315), 14 states have call predecessors, (315), 14 states have return successors, (315), 308 states have call predecessors, (315), 315 states have call successors, (315) [2024-10-11 08:26:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1269 transitions. [2024-10-11 08:26:35,009 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1269 transitions. Word has length 196 [2024-10-11 08:26:35,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:35,010 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1269 transitions. [2024-10-11 08:26:35,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-11 08:26:35,010 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1269 transitions. [2024-10-11 08:26:35,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 08:26:35,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:35,011 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:35,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 08:26:35,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-11 08:26:35,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:26:35,417 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:35,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:35,417 INFO L85 PathProgramCache]: Analyzing trace with hash -425267931, now seen corresponding path program 1 times [2024-10-11 08:26:35,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:35,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875158670] [2024-10-11 08:26:35,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:35,418 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-11 08:26:35,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:35,419 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-11 08:26:35,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-11 08:26:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:35,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 08:26:35,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-11 08:26:36,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:36,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:26:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875158670] [2024-10-11 08:26:36,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875158670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:36,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1695491632] [2024-10-11 08:26:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:36,932 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 08:26:36,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 08:26:36,934 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 08:26:36,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-11 08:26:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:38,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 08:26:38,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:26:38,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-11 08:26:38,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:26:39,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1695491632] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:26:39,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 08:26:39,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-11 08:26:39,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936848320] [2024-10-11 08:26:39,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 08:26:39,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 08:26:39,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:26:39,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 08:26:39,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 08:26:39,147 INFO L87 Difference]: Start difference. First operand 819 states and 1269 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:26:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:26:40,247 INFO L93 Difference]: Finished difference Result 1076 states and 1631 transitions. [2024-10-11 08:26:40,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 08:26:40,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-10-11 08:26:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:26:40,258 INFO L225 Difference]: With dead ends: 1076 [2024-10-11 08:26:40,260 INFO L226 Difference]: Without dead ends: 750 [2024-10-11 08:26:40,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-11 08:26:40,275 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 152 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 08:26:40,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 619 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 08:26:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-10-11 08:26:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 662. [2024-10-11 08:26:40,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 391 states have (on average 1.2813299232736572) internal successors, (501), 395 states have internal predecessors, (501), 255 states have call successors, (255), 15 states have call predecessors, (255), 15 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) [2024-10-11 08:26:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1011 transitions. [2024-10-11 08:26:40,327 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1011 transitions. Word has length 197 [2024-10-11 08:26:40,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:26:40,327 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1011 transitions. [2024-10-11 08:26:40,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-11 08:26:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1011 transitions. [2024-10-11 08:26:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 08:26:40,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:26:40,330 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:26:40,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 08:26:40,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-10-11 08:26:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 08:26:40,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:26:40,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:26:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash -32240921, now seen corresponding path program 1 times [2024-10-11 08:26:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:26:40,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609735837] [2024-10-11 08:26:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:26:40,736 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-11 08:26:40,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:26:40,738 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-11 08:26:40,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 08:26:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:26:41,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-11 08:26:41,119 INFO L278 TraceCheckSpWp]: Computing forward predicates...