./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:03:07,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:03:07,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:03:07,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:03:07,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:03:07,204 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:03:07,204 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:03:07,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:03:07,205 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:03:07,206 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:03:07,206 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:03:07,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:03:07,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:03:07,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:03:07,207 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:03:07,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:03:07,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:03:07,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:03:07,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:03:07,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:03:07,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:03:07,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:03:07,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:03:07,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:03:07,210 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:03:07,210 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:03:07,211 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:03:07,211 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:03:07,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:03:07,212 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:03:07,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:03:07,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:03:07,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:03:07,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:03:07,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:03:07,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:03:07,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:03:07,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:03:07,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:03:07,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:03:07,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:03:07,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:03:07,215 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f [2024-10-24 10:03:07,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:03:07,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:03:07,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:03:07,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:03:07,426 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:03:07,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-10-24 10:03:08,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:03:08,878 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:03:08,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-10-24 10:03:08,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b687ee16/b72ad122ab7b4d718eaca056e0fb89a4/FLAGe309531ef [2024-10-24 10:03:09,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b687ee16/b72ad122ab7b4d718eaca056e0fb89a4 [2024-10-24 10:03:09,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:03:09,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:03:09,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:03:09,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:03:09,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:03:09,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413a3efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09, skipping insertion in model container [2024-10-24 10:03:09,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:03:09,436 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_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-10-24 10:03:09,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:03:09,493 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:03:09,501 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_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-10-24 10:03:09,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:03:09,534 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:03:09,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09 WrapperNode [2024-10-24 10:03:09,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:03:09,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:03:09,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:03:09,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:03:09,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,598 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-10-24 10:03:09,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:03:09,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:03:09,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:03:09,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:03:09,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,620 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:03:09,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,631 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:03:09,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:03:09,636 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:03:09,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:03:09,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (1/1) ... [2024-10-24 10:03:09,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:03:09,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:03:09,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:03:09,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:03:09,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:03:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:03:09,731 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:03:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:03:09,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:03:09,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:03:09,804 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:03:09,807 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:03:10,132 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-24 10:03:10,132 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:03:10,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:03:10,166 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:03:10,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:10 BoogieIcfgContainer [2024-10-24 10:03:10,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:03:10,169 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:03:10,169 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:03:10,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:03:10,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:03:09" (1/3) ... [2024-10-24 10:03:10,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b38b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:10, skipping insertion in model container [2024-10-24 10:03:10,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:09" (2/3) ... [2024-10-24 10:03:10,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b38b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:10, skipping insertion in model container [2024-10-24 10:03:10,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:10" (3/3) ... [2024-10-24 10:03:10,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-74.i [2024-10-24 10:03:10,188 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:03:10,188 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:03:10,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:03:10,241 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;@348c6092, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:03:10,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:03:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 47 states have (on average 1.425531914893617) internal successors, (67), 48 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 10:03:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 10:03:10,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:10,260 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:10,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:10,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1993928170, now seen corresponding path program 1 times [2024-10-24 10:03:10,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:03:10,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349448451] [2024-10-24 10:03:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:03:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:03:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:03:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:03:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:03:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:03:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:03:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:03:10,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:03:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:03:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:03:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:03:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:03:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:03:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:03:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:03:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:03:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:03:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:03:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:03:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:03:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:03:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:03:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:03:10,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:03:10,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349448451] [2024-10-24 10:03:10,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349448451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:03:10,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:03:10,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:03:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596641100] [2024-10-24 10:03:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:03:10,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:03:10,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:03:10,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:03:10,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:03:10,760 INFO L87 Difference]: Start difference. First operand has 72 states, 47 states have (on average 1.425531914893617) internal successors, (67), 48 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:10,831 INFO L93 Difference]: Finished difference Result 172 states and 296 transitions. [2024-10-24 10:03:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:03:10,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-24 10:03:10,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:10,843 INFO L225 Difference]: With dead ends: 172 [2024-10-24 10:03:10,843 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 10:03:10,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:03:10,850 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 42 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:10,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 190 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:03:10,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 10:03:10,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-10-24 10:03:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 10:03:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-10-24 10:03:10,903 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 141 [2024-10-24 10:03:10,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:10,904 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-10-24 10:03:10,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-10-24 10:03:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-24 10:03:10,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:10,908 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:10,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:03:10,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1491692500, now seen corresponding path program 1 times [2024-10-24 10:03:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:03:10,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090186616] [2024-10-24 10:03:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:10,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:03:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:03:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:03:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:03:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:03:11,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:03:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:03:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:03:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:03:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:03:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:03:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:03:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:03:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:03:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:03:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:03:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:03:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:03:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:03:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:03:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:03:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:03:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:03:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:03:11,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:03:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090186616] [2024-10-24 10:03:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090186616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:03:11,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:03:11,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:03:11,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773960962] [2024-10-24 10:03:11,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:03:11,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:03:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:03:11,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:03:11,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:03:11,633 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:11,918 INFO L93 Difference]: Finished difference Result 282 states and 412 transitions. [2024-10-24 10:03:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:03:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-24 10:03:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:11,925 INFO L225 Difference]: With dead ends: 282 [2024-10-24 10:03:11,925 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 10:03:11,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:03:11,928 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 71 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:11,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 326 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:03:11,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 10:03:11,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 144. [2024-10-24 10:03:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 88 states have internal predecessors, (106), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 10:03:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-10-24 10:03:11,963 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 141 [2024-10-24 10:03:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:11,965 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-10-24 10:03:11,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-10-24 10:03:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 10:03:11,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:11,967 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:11,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:03:11,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:11,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 326559582, now seen corresponding path program 1 times [2024-10-24 10:03:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:03:11,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490087508] [2024-10-24 10:03:11,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:03:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:03:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:03:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:03:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:03:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:03:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:03:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:03:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:03:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:03:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:03:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:03:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:03:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:03:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:03:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:03:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:03:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:03:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:03:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:03:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:03:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:03:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:03:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:03:12,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:03:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490087508] [2024-10-24 10:03:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490087508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:03:12,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:03:12,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:03:12,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337839404] [2024-10-24 10:03:12,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:03:12,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:03:12,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:03:12,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:03:12,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:03:12,497 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:12,743 INFO L93 Difference]: Finished difference Result 282 states and 411 transitions. [2024-10-24 10:03:12,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:03:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-24 10:03:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:12,745 INFO L225 Difference]: With dead ends: 282 [2024-10-24 10:03:12,745 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 10:03:12,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:03:12,747 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 69 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:12,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 327 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:03:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 10:03:12,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2024-10-24 10:03:12,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 89 states have internal predecessors, (107), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-24 10:03:12,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 211 transitions. [2024-10-24 10:03:12,767 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 211 transitions. Word has length 142 [2024-10-24 10:03:12,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:12,767 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 211 transitions. [2024-10-24 10:03:12,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:12,767 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 211 transitions. [2024-10-24 10:03:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-24 10:03:12,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:12,769 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:12,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:03:12,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:12,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:12,769 INFO L85 PathProgramCache]: Analyzing trace with hash -953304096, now seen corresponding path program 1 times [2024-10-24 10:03:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:03:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690927162] [2024-10-24 10:03:12,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:03:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:03:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:03:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:03:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:03:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:03:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:03:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:03:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:03:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:03:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:03:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:03:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:03:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:03:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:03:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:03:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:03:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:03:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:03:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:03:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:03:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:03:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:03:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:03:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:03:13,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690927162] [2024-10-24 10:03:13,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690927162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:03:13,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:03:13,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:03:13,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971049574] [2024-10-24 10:03:13,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:03:13,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:03:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:03:13,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:03:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:03:13,454 INFO L87 Difference]: Start difference. First operand 145 states and 211 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:13,772 INFO L93 Difference]: Finished difference Result 316 states and 460 transitions. [2024-10-24 10:03:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:03:13,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-24 10:03:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:13,775 INFO L225 Difference]: With dead ends: 316 [2024-10-24 10:03:13,775 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 10:03:13,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:03:13,779 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 154 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:13,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 504 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:03:13,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 10:03:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2024-10-24 10:03:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 132 states have (on average 1.2121212121212122) internal successors, (160), 135 states have internal predecessors, (160), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 10:03:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 300 transitions. [2024-10-24 10:03:13,818 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 300 transitions. Word has length 142 [2024-10-24 10:03:13,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:13,819 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 300 transitions. [2024-10-24 10:03:13,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 300 transitions. [2024-10-24 10:03:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 10:03:13,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:13,822 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:13,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:03:13,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:13,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1861668433, now seen corresponding path program 1 times [2024-10-24 10:03:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:03:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568069008] [2024-10-24 10:03:13,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:03:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:03:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:03:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:03:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:03:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:03:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:03:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:03:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:03:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:03:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:03:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:03:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:03:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:03:14,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:03:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:03:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 10:03:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 10:03:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 10:03:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:03:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:03:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:03:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:03:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-24 10:03:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:03:14,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568069008] [2024-10-24 10:03:14,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568069008] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:03:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724855835] [2024-10-24 10:03:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:03:14,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:03:14,210 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:03:14,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 10:03:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:14,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 10:03:14,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:03:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 10:03:14,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:03:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 60 proven. 63 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-10-24 10:03:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724855835] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:03:15,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:03:15,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2024-10-24 10:03:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224483456] [2024-10-24 10:03:15,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:03:15,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-24 10:03:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:03:15,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-24 10:03:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2024-10-24 10:03:15,224 INFO L87 Difference]: Start difference. First operand 209 states and 300 transitions. Second operand has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 23 states have internal predecessors, (93), 7 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-10-24 10:03:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:15,987 INFO L93 Difference]: Finished difference Result 401 states and 558 transitions. [2024-10-24 10:03:15,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 10:03:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 23 states have internal predecessors, (93), 7 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) Word has length 144 [2024-10-24 10:03:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:15,990 INFO L225 Difference]: With dead ends: 401 [2024-10-24 10:03:15,991 INFO L226 Difference]: Without dead ends: 240 [2024-10-24 10:03:15,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=368, Invalid=892, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 10:03:15,994 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 293 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:15,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 365 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 10:03:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-24 10:03:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 225. [2024-10-24 10:03:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 144 states have (on average 1.1736111111111112) internal successors, (169), 147 states have internal predecessors, (169), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-24 10:03:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 309 transitions. [2024-10-24 10:03:16,022 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 309 transitions. Word has length 144 [2024-10-24 10:03:16,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:16,023 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 309 transitions. [2024-10-24 10:03:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 23 states have internal predecessors, (93), 7 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-10-24 10:03:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 309 transitions. [2024-10-24 10:03:16,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-24 10:03:16,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:16,026 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:16,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:03:16,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:03:16,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:16,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:16,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1623952237, now seen corresponding path program 1 times [2024-10-24 10:03:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:03:16,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016061754] [2024-10-24 10:03:16,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:03:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:03:16,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459527065] [2024-10-24 10:03:16,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:16,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:03:16,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:03:16,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 10:03:16,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 10:03:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:03:16,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:03:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:03:16,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:03:16,544 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:03:16,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:03:16,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 10:03:16,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 10:03:16,754 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 10:03:16,848 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:03:16,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:03:16 BoogieIcfgContainer [2024-10-24 10:03:16,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:03:16,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:03:16,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:03:16,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:03:16,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:10" (3/4) ... [2024-10-24 10:03:16,855 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:03:16,856 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:03:16,856 INFO L158 Benchmark]: Toolchain (without parser) took 7580.44ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 99.6MB in the beginning and 240.8MB in the end (delta: -141.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-24 10:03:16,856 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 155.2MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:03:16,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.90ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 84.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 10:03:16,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.25ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 81.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:03:16,857 INFO L158 Benchmark]: Boogie Preprocessor took 36.12ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 77.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 10:03:16,857 INFO L158 Benchmark]: RCFGBuilder took 531.49ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 77.4MB in the beginning and 173.2MB in the end (delta: -95.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-24 10:03:16,858 INFO L158 Benchmark]: TraceAbstraction took 6683.20ms. Allocated memory was 213.9MB in the beginning and 310.4MB in the end (delta: 96.5MB). Free memory was 173.2MB in the beginning and 241.8MB in the end (delta: -68.5MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2024-10-24 10:03:16,858 INFO L158 Benchmark]: Witness Printer took 3.46ms. Allocated memory is still 310.4MB. Free memory was 241.8MB in the beginning and 240.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:03:16,859 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.09ms. Allocated memory is still 155.2MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.90ms. Allocated memory is still 155.2MB. Free memory was 99.6MB in the beginning and 84.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.25ms. Allocated memory is still 155.2MB. Free memory was 84.1MB in the beginning and 81.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.12ms. Allocated memory is still 155.2MB. Free memory was 81.2MB in the beginning and 77.4MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 531.49ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 77.4MB in the beginning and 173.2MB in the end (delta: -95.9MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6683.20ms. Allocated memory was 213.9MB in the beginning and 310.4MB in the end (delta: 96.5MB). Free memory was 173.2MB in the beginning and 241.8MB in the end (delta: -68.5MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. * Witness Printer took 3.46ms. Allocated memory is still 310.4MB. Free memory was 241.8MB in the beginning and 240.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] unsigned long int last_1_var_1_1 = 64; [L43] unsigned char last_1_var_1_11 = 50; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L132] last_1_var_1_1 = var_1_1 [L133] last_1_var_1_11 = var_1_11 [L143] RET updateLastVariables() [L144] CALL updateVariables() [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L97] var_1_5 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L100] var_1_7 = __VERIFIER_nondet_ulong() [L101] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L101] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L102] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L103] var_1_9 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L106] var_1_10 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L109] var_1_12 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L112] var_1_13 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L114] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L115] var_1_16 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L118] var_1_17 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L120] var_1_19 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_20 = __VERIFIER_nondet_float() [L123] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L124] var_1_21 = __VERIFIER_nondet_float() [L125] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L125] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L126] var_1_22 = __VERIFIER_nondet_float() [L127] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_23 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET updateVariables() [L145] CALL step() [L47] signed long int stepLocal_1 = last_1_var_1_11; [L48] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L49] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L50] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L54] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L55] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L56] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L67] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L69] COND FALSE !(! (var_1_11 >= var_1_11)) [L76] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L78] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L83] COND FALSE !(\read(var_1_10)) [L86] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L88] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L89] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L136-L137] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 649 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 629 mSDsluCounter, 1712 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1188 mSDsCounter, 296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1002 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 296 mSolverCounterUnsat, 524 mSDtfsCounter, 1002 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=5, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 109 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 991 ConstructedInterpolants, 0 QuantifiedInterpolants, 3671 SizeOfPredicates, 4 NumberOfNonLiveVariables, 325 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6312/6468 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:03:16,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:03:18,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:03:18,974 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:03:18,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:03:18,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:03:19,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:03:19,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:03:19,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:03:19,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:03:19,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:03:19,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:03:19,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:03:19,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:03:19,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:03:19,010 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:03:19,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:03:19,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:03:19,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:03:19,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:03:19,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:03:19,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:03:19,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:03:19,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:03:19,014 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:03:19,014 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:03:19,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:03:19,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:03:19,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:03:19,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:03:19,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:03:19,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:03:19,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:03:19,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:03:19,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:03:19,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:03:19,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:03:19,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:03:19,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:03:19,018 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:03:19,018 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:03:19,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:03:19,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:03:19,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:03:19,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:03:19,019 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:03:19,019 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b82c9a8499c502d0bd74801770530955769ac9e616506e7cf0d04286124c996f [2024-10-24 10:03:19,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:03:19,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:03:19,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:03:19,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:03:19,352 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:03:19,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-10-24 10:03:20,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:03:20,904 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:03:20,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-74.i [2024-10-24 10:03:20,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dfb2e20/db4796ee21ab431b94a309097ee988fc/FLAGf36844390 [2024-10-24 10:03:21,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00dfb2e20/db4796ee21ab431b94a309097ee988fc [2024-10-24 10:03:21,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:03:21,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:03:21,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:03:21,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:03:21,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:03:21,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e67a8a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21, skipping insertion in model container [2024-10-24 10:03:21,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:03:21,485 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_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-10-24 10:03:21,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:03:21,544 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:03:21,553 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_loopvsstraightlinecode_50-while_file-74.i[915,928] [2024-10-24 10:03:21,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:03:21,596 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:03:21,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21 WrapperNode [2024-10-24 10:03:21,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:03:21,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:03:21,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:03:21,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:03:21,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,634 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2024-10-24 10:03:21,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:03:21,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:03:21,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:03:21,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:03:21,645 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,670 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:03:21,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,671 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:03:21,697 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:03:21,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:03:21,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:03:21,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (1/1) ... [2024-10-24 10:03:21,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:03:21,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:03:21,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 10:03:21,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 10:03:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:03:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:03:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:03:21,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:03:21,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:03:21,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:03:21,825 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:03:21,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:03:23,144 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-24 10:03:23,145 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:03:23,188 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:03:23,188 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:03:23,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:23 BoogieIcfgContainer [2024-10-24 10:03:23,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:03:23,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:03:23,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:03:23,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:03:23,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:03:21" (1/3) ... [2024-10-24 10:03:23,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10890cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:23, skipping insertion in model container [2024-10-24 10:03:23,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:03:21" (2/3) ... [2024-10-24 10:03:23,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10890cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:03:23, skipping insertion in model container [2024-10-24 10:03:23,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:03:23" (3/3) ... [2024-10-24 10:03:23,195 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-74.i [2024-10-24 10:03:23,209 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:03:23,209 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:03:23,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:03:23,266 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;@62caa908, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:03:23,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:03:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 10:03:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 10:03:23,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:23,281 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:23,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:23,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1971942415, now seen corresponding path program 1 times [2024-10-24 10:03:23,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:03:23,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946265508] [2024-10-24 10:03:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:23,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:03:23,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:03:23,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 10:03:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:23,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:03:23,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:03:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-24 10:03:23,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:03:23,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:03:23,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946265508] [2024-10-24 10:03:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946265508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:03:23,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:03:23,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:03:23,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148029235] [2024-10-24 10:03:23,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:03:23,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:03:23,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:03:23,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:03:23,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:03:23,695 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 10:03:25,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:03:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:25,071 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2024-10-24 10:03:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:03:25,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 137 [2024-10-24 10:03:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:25,107 INFO L225 Difference]: With dead ends: 120 [2024-10-24 10:03:25,107 INFO L226 Difference]: Without dead ends: 59 [2024-10-24 10:03:25,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:03:25,112 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:25,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 10:03:25,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-24 10:03:25,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-24 10:03:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 10:03:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-24 10:03:25,160 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 137 [2024-10-24 10:03:25,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:25,160 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-24 10:03:25,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 10:03:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-24 10:03:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 10:03:25,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:25,163 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:25,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 10:03:25,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:25,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:25,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:25,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1341530267, now seen corresponding path program 1 times [2024-10-24 10:03:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:03:25,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254998852] [2024-10-24 10:03:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:25,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:25,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:03:25,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:03:25,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 10:03:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:25,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 10:03:25,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:03:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:03:26,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:03:26,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:03:26,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254998852] [2024-10-24 10:03:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254998852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:03:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:03:26,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:03:26,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956350679] [2024-10-24 10:03:26,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:03:26,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:03:26,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:03:26,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:03:26,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:03:26,830 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:28,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:03:30,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:03:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:30,211 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2024-10-24 10:03:30,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:03:30,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 137 [2024-10-24 10:03:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:30,231 INFO L225 Difference]: With dead ends: 176 [2024-10-24 10:03:30,231 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 10:03:30,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:03:30,233 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 50 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:30,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 276 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-24 10:03:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 10:03:30,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-10-24 10:03:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 10:03:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2024-10-24 10:03:30,276 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 137 [2024-10-24 10:03:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:30,276 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2024-10-24 10:03:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2024-10-24 10:03:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 10:03:30,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:30,278 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:30,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 10:03:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:30,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:30,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 322864013, now seen corresponding path program 1 times [2024-10-24 10:03:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:03:30,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173348930] [2024-10-24 10:03:30,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:30,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:30,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:03:30,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:03:30,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 10:03:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:30,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 10:03:30,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:03:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 10:03:31,464 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:03:31,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:03:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173348930] [2024-10-24 10:03:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173348930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:03:31,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:03:31,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:03:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578616606] [2024-10-24 10:03:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:03:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:03:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:03:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:03:31,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:03:31,473 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:33,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:03:35,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:03:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:35,195 INFO L93 Difference]: Finished difference Result 176 states and 265 transitions. [2024-10-24 10:03:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:03:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2024-10-24 10:03:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:35,215 INFO L225 Difference]: With dead ends: 176 [2024-10-24 10:03:35,215 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 10:03:35,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:03:35,217 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 48 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:35,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 277 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 10:03:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 10:03:35,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2024-10-24 10:03:35,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-24 10:03:35,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 153 transitions. [2024-10-24 10:03:35,243 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 153 transitions. Word has length 138 [2024-10-24 10:03:35,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:35,243 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 153 transitions. [2024-10-24 10:03:35,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 10:03:35,243 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 153 transitions. [2024-10-24 10:03:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 10:03:35,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:35,245 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:35,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 10:03:35,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:35,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:35,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:35,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1023928591, now seen corresponding path program 1 times [2024-10-24 10:03:35,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:03:35,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824770708] [2024-10-24 10:03:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:35,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:03:35,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:03:35,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 10:03:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:35,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:03:35,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:03:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-24 10:03:36,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:03:36,863 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-24 10:03:36,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:03:36,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824770708] [2024-10-24 10:03:36,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824770708] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:03:36,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:03:36,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-24 10:03:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709504774] [2024-10-24 10:03:36,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:03:36,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 10:03:36,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:03:36,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 10:03:36,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-24 10:03:36,865 INFO L87 Difference]: Start difference. First operand 102 states and 153 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 10:03:40,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:03:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:03:40,588 INFO L93 Difference]: Finished difference Result 213 states and 303 transitions. [2024-10-24 10:03:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 10:03:40,589 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 138 [2024-10-24 10:03:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:03:40,595 INFO L225 Difference]: With dead ends: 213 [2024-10-24 10:03:40,595 INFO L226 Difference]: Without dead ends: 155 [2024-10-24 10:03:40,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-10-24 10:03:40,599 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 78 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 10:03:40,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 348 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 10:03:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-24 10:03:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2024-10-24 10:03:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 84 states have (on average 1.1547619047619047) internal successors, (97), 85 states have internal predecessors, (97), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 10:03:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 205 transitions. [2024-10-24 10:03:40,635 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 205 transitions. Word has length 138 [2024-10-24 10:03:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:03:40,635 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 205 transitions. [2024-10-24 10:03:40,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-24 10:03:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 205 transitions. [2024-10-24 10:03:40,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 10:03:40,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:03:40,637 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:03:40,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 10:03:40,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:40,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:03:40,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:03:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1023988173, now seen corresponding path program 1 times [2024-10-24 10:03:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:03:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759374781] [2024-10-24 10:03:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:03:40,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:03:40,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:03:40,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 10:03:40,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 10:03:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:03:41,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-24 10:03:41,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:04:18,926 WARN L286 SmtUtils]: Spent 11.20s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)