./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.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 f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:57:11,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:57:11,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 06:57:11,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:57:11,310 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:57:11,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:57:11,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:57:11,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:57:11,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:57:11,346 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:57:11,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:57:11,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:57:11,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:57:11,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:57:11,349 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:57:11,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:57:11,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:57:11,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:57:11,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 06:57:11,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:57:11,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:57:11,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:57:11,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:57:11,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:57:11,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:57:11,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:57:11,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:57:11,356 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:57:11,356 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:57:11,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:57:11,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:57:11,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:57:11,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:57:11,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:57:11,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:57:11,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:57:11,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 06:57:11,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 06:57:11,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:57:11,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:57:11,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:57:11,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:57:11,360 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 -> f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 [2024-10-24 06:57:11,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:57:11,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:57:11,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:57:11,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:57:11,678 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:57:11,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-24 06:57:13,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:57:13,421 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:57:13,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-24 06:57:13,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10557873/32d3df3de6cb4f4e892fbe702f0b4e22/FLAG25c9bed8c [2024-10-24 06:57:13,447 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a10557873/32d3df3de6cb4f4e892fbe702f0b4e22 [2024-10-24 06:57:13,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:57:13,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:57:13,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:57:13,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:57:13,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:57:13,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:13,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@641f150e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13, skipping insertion in model container [2024-10-24 06:57:13,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:13,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:57:13,696 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-24 06:57:13,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:57:13,838 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:57:13,851 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-24 06:57:13,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:57:13,909 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:57:13,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13 WrapperNode [2024-10-24 06:57:13,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:57:13,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:57:13,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:57:13,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:57:13,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:13,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:13,964 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-24 06:57:13,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:57:13,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:57:13,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:57:13,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:57:13,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:13,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:13,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:13,999 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 06:57:13,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:14,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:14,008 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:14,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:14,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:14,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:14,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:57:14,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:57:14,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:57:14,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:57:14,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (1/1) ... [2024-10-24 06:57:14,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:57:14,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:57:14,062 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 06:57:14,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 06:57:14,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:57:14,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:57:14,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:57:14,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 06:57:14,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:57:14,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:57:14,219 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:57:14,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:57:14,634 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-24 06:57:14,635 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:57:14,681 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:57:14,682 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:57:14,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:14 BoogieIcfgContainer [2024-10-24 06:57:14,683 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:57:14,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:57:14,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:57:14,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:57:14,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:57:13" (1/3) ... [2024-10-24 06:57:14,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f86c32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:57:14, skipping insertion in model container [2024-10-24 06:57:14,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:13" (2/3) ... [2024-10-24 06:57:14,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f86c32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:57:14, skipping insertion in model container [2024-10-24 06:57:14,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:14" (3/3) ... [2024-10-24 06:57:14,693 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-24 06:57:14,709 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:57:14,710 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:57:14,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:57:14,786 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;@5dcdbf0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:57:14,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:57:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:14,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 06:57:14,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:14,809 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:14,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:14,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:14,814 INFO L85 PathProgramCache]: Analyzing trace with hash 892013310, now seen corresponding path program 1 times [2024-10-24 06:57:14,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119918558] [2024-10-24 06:57:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:57:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:57:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:57:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:57:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:57:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:57:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:57:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:57:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:57:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:57:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:57:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:57:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:57:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:57:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:57:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:57:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:57:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:57:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:57:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:57:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:57:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:57:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:57:15,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:57:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:15,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:15,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119918558] [2024-10-24 06:57:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119918558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:15,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:15,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:57:15,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373580717] [2024-10-24 06:57:15,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:15,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:57:15,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:57:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:57:15,383 INFO L87 Difference]: Start difference. First operand has 96 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 70 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:57:15,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:15,437 INFO L93 Difference]: Finished difference Result 189 states and 332 transitions. [2024-10-24 06:57:15,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:57:15,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-24 06:57:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:15,453 INFO L225 Difference]: With dead ends: 189 [2024-10-24 06:57:15,453 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 06:57:15,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 06:57:15,463 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:15,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:57:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 06:57:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 06:57:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:15,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 148 transitions. [2024-10-24 06:57:15,527 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 148 transitions. Word has length 161 [2024-10-24 06:57:15,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:15,529 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 148 transitions. [2024-10-24 06:57:15,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:57:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 148 transitions. [2024-10-24 06:57:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 06:57:15,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:15,535 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:15,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 06:57:15,536 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:15,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1424708546, now seen corresponding path program 1 times [2024-10-24 06:57:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:15,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724257183] [2024-10-24 06:57:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:15,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:57:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:57:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:57:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:57:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:57:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:57:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:57:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:57:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:57:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:57:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:57:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:57:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:57:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:57:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:57:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:57:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:57:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:57:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:57:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:57:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:57:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:57:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:57:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:57:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:15,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:15,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724257183] [2024-10-24 06:57:15,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724257183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:15,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:15,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:57:15,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161612601] [2024-10-24 06:57:15,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:15,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 06:57:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 06:57:15,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 06:57:15,982 INFO L87 Difference]: Start difference. First operand 94 states and 148 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:16,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:16,030 INFO L93 Difference]: Finished difference Result 187 states and 295 transitions. [2024-10-24 06:57:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:57:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-24 06:57:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:16,033 INFO L225 Difference]: With dead ends: 187 [2024-10-24 06:57:16,037 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 06:57:16,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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 06:57:16,039 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:16,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 06:57:16,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 06:57:16,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-24 06:57:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 147 transitions. [2024-10-24 06:57:16,064 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 147 transitions. Word has length 161 [2024-10-24 06:57:16,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:16,067 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 147 transitions. [2024-10-24 06:57:16,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 147 transitions. [2024-10-24 06:57:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 06:57:16,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:16,073 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:16,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 06:57:16,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:16,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1486748160, now seen corresponding path program 1 times [2024-10-24 06:57:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:16,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219105527] [2024-10-24 06:57:16,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:57:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:57:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:57:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:57:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:57:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:57:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:57:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:57:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:57:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:57:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:57:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:57:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:57:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:57:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:57:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:57:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:57:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:57:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:57:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:57:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:57:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:57:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:57:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:57:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:16,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:16,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219105527] [2024-10-24 06:57:16,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219105527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:16,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:16,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:57:16,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740777090] [2024-10-24 06:57:16,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:16,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:57:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:16,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:57:16,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:57:16,552 INFO L87 Difference]: Start difference. First operand 94 states and 147 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:16,795 INFO L93 Difference]: Finished difference Result 279 states and 437 transitions. [2024-10-24 06:57:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:57:16,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-24 06:57:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:16,799 INFO L225 Difference]: With dead ends: 279 [2024-10-24 06:57:16,799 INFO L226 Difference]: Without dead ends: 186 [2024-10-24 06:57:16,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:57:16,801 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 124 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:16,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 367 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:57:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-24 06:57:16,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 128. [2024-10-24 06:57:16,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.5392156862745099) internal successors, (157), 102 states have internal predecessors, (157), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:16,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 205 transitions. [2024-10-24 06:57:16,826 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 205 transitions. Word has length 161 [2024-10-24 06:57:16,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:16,827 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 205 transitions. [2024-10-24 06:57:16,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 205 transitions. [2024-10-24 06:57:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 06:57:16,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:16,832 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:16,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 06:57:16,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:16,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:16,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1620761666, now seen corresponding path program 1 times [2024-10-24 06:57:16,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:16,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725445437] [2024-10-24 06:57:16,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:16,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:57:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:57:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:57:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:57:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:57:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:57:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:57:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:57:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:57:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:57:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:57:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:57:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:57:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:57:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:57:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:57:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:57:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:57:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:57:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:57:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:57:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:57:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:57:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:57:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:17,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725445437] [2024-10-24 06:57:17,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725445437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:17,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:17,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:57:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148538982] [2024-10-24 06:57:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:17,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:57:17,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:17,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:57:17,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:57:17,386 INFO L87 Difference]: Start difference. First operand 128 states and 205 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:17,575 INFO L93 Difference]: Finished difference Result 255 states and 409 transitions. [2024-10-24 06:57:17,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:57:17,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-24 06:57:17,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:17,581 INFO L225 Difference]: With dead ends: 255 [2024-10-24 06:57:17,581 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 06:57:17,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:57:17,583 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 104 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:17,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 224 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 06:57:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 06:57:17,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-24 06:57:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 102 states have internal predecessors, (155), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:17,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2024-10-24 06:57:17,610 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 203 transitions. Word has length 161 [2024-10-24 06:57:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:17,611 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 203 transitions. [2024-10-24 06:57:17,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 203 transitions. [2024-10-24 06:57:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 06:57:17,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:17,615 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:17,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 06:57:17,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:17,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:17,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1839616384, now seen corresponding path program 1 times [2024-10-24 06:57:17,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:17,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908891344] [2024-10-24 06:57:17,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:17,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:57:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:57:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:57:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:57:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:57:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:57:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:57:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:57:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:57:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:57:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:57:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:57:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:57:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:57:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:57:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:57:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:57:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:57:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:57:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:57:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:57:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:57:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:57:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:57:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:17,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:17,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908891344] [2024-10-24 06:57:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908891344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:17,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:17,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:57:17,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647452548] [2024-10-24 06:57:17,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:17,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:57:17,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:17,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:57:17,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:57:17,883 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:57:18,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:18,002 INFO L93 Difference]: Finished difference Result 255 states and 405 transitions. [2024-10-24 06:57:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 06:57:18,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-10-24 06:57:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:18,004 INFO L225 Difference]: With dead ends: 255 [2024-10-24 06:57:18,004 INFO L226 Difference]: Without dead ends: 128 [2024-10-24 06:57:18,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:57:18,006 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:18,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 125 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:57:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-24 06:57:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-10-24 06:57:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.5) internal successors, (153), 102 states have internal predecessors, (153), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 201 transitions. [2024-10-24 06:57:18,023 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 201 transitions. Word has length 161 [2024-10-24 06:57:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:18,024 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 201 transitions. [2024-10-24 06:57:18,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:57:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 201 transitions. [2024-10-24 06:57:18,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-24 06:57:18,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:18,027 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:18,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 06:57:18,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:18,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:18,028 INFO L85 PathProgramCache]: Analyzing trace with hash -680343550, now seen corresponding path program 1 times [2024-10-24 06:57:18,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:18,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590728942] [2024-10-24 06:57:18,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:18,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 06:57:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 06:57:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 06:57:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 06:57:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 06:57:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 06:57:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 06:57:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 06:57:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 06:57:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 06:57:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 06:57:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 06:57:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 06:57:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 06:57:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 06:57:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 06:57:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 06:57:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 06:57:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 06:57:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 06:57:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 06:57:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 06:57:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 06:57:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 06:57:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:18,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:18,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590728942] [2024-10-24 06:57:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590728942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:18,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:18,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 06:57:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884273590] [2024-10-24 06:57:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:57:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:57:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:57:18,423 INFO L87 Difference]: Start difference. First operand 128 states and 201 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:18,829 INFO L93 Difference]: Finished difference Result 313 states and 486 transitions. [2024-10-24 06:57:18,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:57:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-10-24 06:57:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:18,832 INFO L225 Difference]: With dead ends: 313 [2024-10-24 06:57:18,832 INFO L226 Difference]: Without dead ends: 186 [2024-10-24 06:57:18,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 06:57:18,835 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 191 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:18,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 323 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 06:57:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-24 06:57:18,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2024-10-24 06:57:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 107 states have internal predecessors, (158), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2024-10-24 06:57:18,866 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 161 [2024-10-24 06:57:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:18,869 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2024-10-24 06:57:18,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2024-10-24 06:57:18,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-24 06:57:18,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:18,871 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:18,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 06:57:18,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:18,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1964241248, now seen corresponding path program 1 times [2024-10-24 06:57:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132335559] [2024-10-24 06:57:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:57:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1848338414] [2024-10-24 06:57:18,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:18,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:57:18,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:57:18,991 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 06:57:18,993 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 06:57:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:19,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-24 06:57:19,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:57:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-10-24 06:57:20,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:57:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-10-24 06:57:21,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132335559] [2024-10-24 06:57:21,228 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 06:57:21,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848338414] [2024-10-24 06:57:21,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848338414] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:57:21,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:57:21,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-10-24 06:57:21,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088165179] [2024-10-24 06:57:21,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:57:21,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 06:57:21,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:21,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 06:57:21,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-10-24 06:57:21,234 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-10-24 06:57:22,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:22,941 INFO L93 Difference]: Finished difference Result 395 states and 591 transitions. [2024-10-24 06:57:22,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 06:57:22,944 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 163 [2024-10-24 06:57:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:22,946 INFO L225 Difference]: With dead ends: 395 [2024-10-24 06:57:22,946 INFO L226 Difference]: Without dead ends: 263 [2024-10-24 06:57:22,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 06:57:22,948 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 572 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:22,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 328 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 06:57:22,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-24 06:57:22,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 190. [2024-10-24 06:57:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 162 states have (on average 1.5) internal successors, (243), 162 states have internal predecessors, (243), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 291 transitions. [2024-10-24 06:57:22,984 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 291 transitions. Word has length 163 [2024-10-24 06:57:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:22,984 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 291 transitions. [2024-10-24 06:57:22,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-10-24 06:57:22,987 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2024-10-24 06:57:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 06:57:22,989 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:22,989 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:23,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:57:23,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:57:23,190 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:23,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:23,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1049786570, now seen corresponding path program 1 times [2024-10-24 06:57:23,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:23,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61458160] [2024-10-24 06:57:23,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:23,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:57:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1641798958] [2024-10-24 06:57:23,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:23,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:57:23,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:57:23,306 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 06:57:23,308 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 06:57:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:23,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 06:57:23,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:57:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 473 proven. 30 refuted. 0 times theorem prover too weak. 601 trivial. 0 not checked. [2024-10-24 06:57:24,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 06:57:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 102 proven. 33 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-24 06:57:27,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 06:57:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61458160] [2024-10-24 06:57:27,987 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 06:57:27,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641798958] [2024-10-24 06:57:27,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641798958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 06:57:27,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 06:57:27,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-24 06:57:27,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487285626] [2024-10-24 06:57:27,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 06:57:27,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 06:57:27,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 06:57:27,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 06:57:27,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=273, Unknown=8, NotChecked=0, Total=380 [2024-10-24 06:57:27,990 INFO L87 Difference]: Start difference. First operand 190 states and 291 transitions. Second operand has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-24 06:57:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:29,686 INFO L93 Difference]: Finished difference Result 397 states and 592 transitions. [2024-10-24 06:57:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 06:57:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) Word has length 164 [2024-10-24 06:57:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:29,689 INFO L225 Difference]: With dead ends: 397 [2024-10-24 06:57:29,689 INFO L226 Difference]: Without dead ends: 208 [2024-10-24 06:57:29,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=267, Invalid=595, Unknown=8, NotChecked=0, Total=870 [2024-10-24 06:57:29,690 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:29,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 374 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:57:29,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-24 06:57:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2024-10-24 06:57:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.437125748502994) internal successors, (240), 167 states have internal predecessors, (240), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 288 transitions. [2024-10-24 06:57:29,717 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 288 transitions. Word has length 164 [2024-10-24 06:57:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:29,718 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 288 transitions. [2024-10-24 06:57:29,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.157894736842105) internal successors, (79), 18 states have internal predecessors, (79), 5 states have call successors, (30), 3 states have call predecessors, (30), 6 states have return successors, (31), 5 states have call predecessors, (31), 5 states have call successors, (31) [2024-10-24 06:57:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 288 transitions. [2024-10-24 06:57:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-24 06:57:29,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:29,720 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:29,739 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 06:57:29,921 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,SelfDestructingSolverStorable7 [2024-10-24 06:57:29,922 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:29,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:29,922 INFO L85 PathProgramCache]: Analyzing trace with hash 395281974, now seen corresponding path program 1 times [2024-10-24 06:57:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 06:57:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170782206] [2024-10-24 06:57:29,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:29,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 06:57:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 06:57:30,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [991067823] [2024-10-24 06:57:30,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:30,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:57:30,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:57:30,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 06:57:30,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 06:57:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:57:30,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 06:57:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 06:57:30,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 06:57:30,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 06:57:30,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 06:57:30,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 06:57:30,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 06:57:30,472 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 06:57:30,595 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 06:57:30,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 06:57:30 BoogieIcfgContainer [2024-10-24 06:57:30,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 06:57:30,598 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 06:57:30,598 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 06:57:30,598 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 06:57:30,599 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:14" (3/4) ... [2024-10-24 06:57:30,601 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 06:57:30,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 06:57:30,603 INFO L158 Benchmark]: Toolchain (without parser) took 17151.56ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 97.9MB in the beginning and 88.9MB in the end (delta: 9.0MB). Peak memory consumption was 130.4MB. Max. memory is 16.1GB. [2024-10-24 06:57:30,603 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 94.4MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 06:57:30,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.58ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 129.2MB in the end (delta: -31.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-24 06:57:30,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.62ms. Allocated memory is still 163.6MB. Free memory was 128.7MB in the beginning and 125.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:57:30,603 INFO L158 Benchmark]: Boogie Preprocessor took 54.65ms. Allocated memory is still 163.6MB. Free memory was 125.6MB in the beginning and 121.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 06:57:30,604 INFO L158 Benchmark]: RCFGBuilder took 662.21ms. Allocated memory is still 163.6MB. Free memory was 121.7MB in the beginning and 92.4MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-24 06:57:30,604 INFO L158 Benchmark]: TraceAbstraction took 15912.72ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 91.5MB in the beginning and 90.0MB in the end (delta: 1.5MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. [2024-10-24 06:57:30,604 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 285.2MB. Free memory was 90.0MB in the beginning and 88.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 06:57:30,606 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.25ms. Allocated memory is still 94.4MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.58ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 129.2MB in the end (delta: -31.7MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.62ms. Allocated memory is still 163.6MB. Free memory was 128.7MB in the beginning and 125.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.65ms. Allocated memory is still 163.6MB. Free memory was 125.6MB in the beginning and 121.7MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 662.21ms. Allocated memory is still 163.6MB. Free memory was 121.7MB in the beginning and 92.4MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15912.72ms. Allocated memory was 163.6MB in the beginning and 285.2MB in the end (delta: 121.6MB). Free memory was 91.5MB in the beginning and 90.0MB in the end (delta: 1.5MB). Peak memory consumption was 123.7MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 285.2MB. Free memory was 90.0MB in the beginning and 88.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 185, overapproximation of someBinaryArithmeticDOUBLEoperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someUnaryFLOAToperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 8.5; [L23] unsigned long int var_1_4 = 1; [L24] unsigned long int var_1_5 = 50; [L25] unsigned long int var_1_6 = 4; [L26] float var_1_7 = 15.8; [L27] float var_1_8 = 64.25; [L28] signed long int var_1_9 = -50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 3207304078; [L31] unsigned long int var_1_15 = 50; [L32] unsigned long int var_1_16 = 25; [L33] unsigned char var_1_17 = 1; [L34] unsigned char var_1_18 = 0; [L35] unsigned char var_1_19 = 0; [L36] unsigned short int var_1_20 = 1; [L37] unsigned long int var_1_21 = 50; [L38] signed char var_1_22 = -4; [L39] signed char var_1_23 = -10; [L40] unsigned long int var_1_24 = 2; [L41] unsigned long int var_1_26 = 1; [L42] double var_1_33 = 1.5; [L43] double var_1_35 = 50.5; [L44] double var_1_36 = 1.9; [L45] unsigned long int var_1_37 = 10000; [L46] unsigned char var_1_38 = 1; [L47] unsigned char var_1_39 = 0; [L48] double var_1_40 = 15.5; [L49] unsigned long int var_1_42 = 128; [L50] signed char var_1_43 = -1; [L51] signed long int last_1_var_1_9 = -50; [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L182] last_1_var_1_9 = var_1_9 [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_ulong() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L145] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L146] var_1_6 = __VERIFIER_nondet_ulong() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] CALL assume_abort_if_not(var_1_6 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L148] RET assume_abort_if_not(var_1_6 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_8=257/4, var_1_9=-50] [L149] var_1_8 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L150] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=3207304078, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L151] var_1_14 = __VERIFIER_nondet_ulong() [L152] CALL assume_abort_if_not(var_1_14 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L152] RET assume_abort_if_not(var_1_14 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] CALL assume_abort_if_not(var_1_14 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L153] RET assume_abort_if_not(var_1_14 <= 4294967295) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=50, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L154] var_1_15 = __VERIFIER_nondet_ulong() [L155] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L155] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L156] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=25, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L157] var_1_16 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L158] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L159] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L160] var_1_17 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L161] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L162] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L164] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L165] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=1, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L167] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L169] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-10, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L170] var_1_23 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L171] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L172] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_35=101/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L173] var_1_35 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L174] RET assume_abort_if_not((var_1_35 >= 0.0F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_36=19/10, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L175] var_1_36 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L176] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L177] var_1_39 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L178] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L179] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L193] RET updateVariables() [L194] CALL step() [L55] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_0=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L56] COND FALSE !(stepLocal_0 < last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=50, var_1_22=-4, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L59] var_1_21 = var_1_6 [L60] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L61] COND FALSE !((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L64] unsigned long int stepLocal_4 = 4256310412u - 128u; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_4=4256310284, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L65] COND FALSE !(var_1_4 >= stepLocal_4) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L68] signed long int stepLocal_3 = var_1_9; [L69] unsigned long int stepLocal_2 = (((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] EXPR var_1_21 ^ 4u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_2=0, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=79/5, var_1_9=-50] [L70] unsigned long int stepLocal_1 = var_1_21 ^ 4u; [L71] COND FALSE !(var_1_9 <= stepLocal_2) [L80] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L82] COND FALSE !(var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) [L89] var_1_13 = var_1_18 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L91] signed long int stepLocal_5 = (var_1_22 / 2) / var_1_20; VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, stepLocal_5=0, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L92] COND TRUE stepLocal_5 >= (~ 100) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L93] COND TRUE \read(var_1_13) [L94] var_1_19 = (var_1_17 && var_1_18) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=2, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L103] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=1, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L104] COND FALSE !(var_1_5 != var_1_21) [L111] var_1_26 = 16u VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_33=3/2, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L113] COND TRUE \read(var_1_17) [L114] var_1_33 = (var_1_35 - var_1_36) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L116] COND FALSE !(var_1_35 >= var_1_8) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L121] COND TRUE var_1_16 < ((var_1_6 + 16u) * var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L122] COND FALSE !(var_1_17 && (var_1_35 < var_1_36)) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=31/2, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L130] COND TRUE (var_1_35 <= 64.5) && var_1_18 [L131] var_1_40 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L135] COND FALSE !(var_1_20 < var_1_9) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=-1, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L138] COND TRUE \read(var_1_17) [L139] var_1_43 = ((((((((-16) < 0 ) ? -(-16) : (-16)))) > (var_1_23)) ? (((((-16) < 0 ) ? -(-16) : (-16)))) : (var_1_23))) VAL [isInitial=1, last_1_var_1_9=-50, stepLocal_1=4, stepLocal_3=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185] EXPR (var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185] EXPR ((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8))) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L185-L186] return (((((((((var_1_21 / ((((64u) < 0 ) ? -(64u) : (64u)))) == var_1_4) ? (var_1_1 == ((double) (8.8 - 255.2))) : 1) && ((last_1_var_1_9 < last_1_var_1_9) ? (var_1_4 == ((unsigned long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : 1)) && ((var_1_9 <= ((((var_1_21) > (var_1_5)) ? (var_1_21) : (var_1_5)))) ? ((var_1_9 < var_1_5) ? ((var_1_9 >= (var_1_21 ^ 4u)) ? (var_1_7 == ((float) var_1_8)) : 1) : (var_1_7 == ((float) var_1_8))) : (var_1_7 == ((float) var_1_8)))) && ((var_1_4 >= (4256310412u - 128u)) ? (var_1_9 == ((signed long int) (((((var_1_22 + var_1_22) < 0 ) ? -(var_1_22 + var_1_22) : (var_1_22 + var_1_22))) + var_1_22))) : 1)) && ((var_1_21 >= (var_1_14 - ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) ? ((var_1_16 < var_1_9) ? (var_1_13 == ((unsigned char) var_1_17)) : (var_1_13 == ((unsigned char) var_1_17))) : (var_1_13 == ((unsigned char) var_1_18)))) && ((((var_1_22 / 2) / var_1_20) >= (~ 100)) ? (var_1_13 ? (var_1_19 == ((unsigned char) (var_1_17 && var_1_18))) : 1) : (var_1_17 ? (var_1_19 == ((unsigned char) var_1_18)) : (var_1_19 == ((unsigned char) var_1_18))))) && (var_1_21 == ((unsigned long int) var_1_6))) && (var_1_22 == ((signed char) var_1_23)) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=-50, var_1_13=1, var_1_14=-6442450945, var_1_15=0, var_1_16=-4294967296, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=17/2, var_1_20=2, var_1_21=0, var_1_22=-2, var_1_23=-2, var_1_24=0, var_1_26=16, var_1_37=10000, var_1_38=1, var_1_39=0, var_1_40=3, var_1_42=128, var_1_43=16, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=2, var_1_8=2, var_1_9=-50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 9, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1426 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1414 mSDsluCounter, 2170 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1054 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1084 IncrementalHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 1116 mSDtfsCounter, 1084 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1021 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=8, InterpolantAutomatonStates: 65, 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, 8 MinimizatonAttempts, 194 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1948 NumberOfCodeBlocks, 1948 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1610 ConstructedInterpolants, 5 QuantifiedInterpolants, 8349 SizeOfPredicates, 11 NumberOfNonLiveVariables, 755 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 10899/11040 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 06:57:30,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.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 f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 06:57:32,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 06:57:33,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 06:57:33,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 06:57:33,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 06:57:33,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 06:57:33,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 06:57:33,083 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 06:57:33,084 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 06:57:33,084 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 06:57:33,085 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 06:57:33,085 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 06:57:33,086 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 06:57:33,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 06:57:33,088 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 06:57:33,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 06:57:33,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 06:57:33,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 06:57:33,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 06:57:33,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 06:57:33,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 06:57:33,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 06:57:33,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 06:57:33,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 06:57:33,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 06:57:33,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 06:57:33,095 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 06:57:33,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 06:57:33,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 06:57:33,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 06:57:33,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 06:57:33,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 06:57:33,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 06:57:33,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 06:57:33,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:57:33,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 06:57:33,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 06:57:33,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 06:57:33,098 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 06:57:33,098 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 06:57:33,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 06:57:33,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 06:57:33,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 06:57:33,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 06:57:33,100 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 06:57:33,101 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 -> f8c7f093a0092c99d535dacf9ec847d585a162cf9e23f66317fd8ccac5a76f81 [2024-10-24 06:57:33,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 06:57:33,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 06:57:33,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 06:57:33,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 06:57:33,467 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 06:57:33,470 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-24 06:57:35,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 06:57:35,334 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 06:57:35,335 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-24 06:57:35,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5476a1a63/01a89c8d195043f3b356208208f5a293/FLAGfd680f31c [2024-10-24 06:57:35,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5476a1a63/01a89c8d195043f3b356208208f5a293 [2024-10-24 06:57:35,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 06:57:35,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 06:57:35,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 06:57:35,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 06:57:35,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 06:57:35,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@949710b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35, skipping insertion in model container [2024-10-24 06:57:35,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 06:57:35,628 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-24 06:57:35,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:57:35,741 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 06:57:35,757 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i[919,932] [2024-10-24 06:57:35,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 06:57:35,828 INFO L204 MainTranslator]: Completed translation [2024-10-24 06:57:35,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35 WrapperNode [2024-10-24 06:57:35,828 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 06:57:35,829 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 06:57:35,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 06:57:35,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 06:57:35,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,894 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-24 06:57:35,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 06:57:35,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 06:57:35,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 06:57:35,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 06:57:35,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,947 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 06:57:35,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:35,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 06:57:35,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 06:57:35,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 06:57:35,989 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 06:57:35,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (1/1) ... [2024-10-24 06:57:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 06:57:36,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 06:57:36,031 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 06:57:36,041 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 06:57:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 06:57:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 06:57:36,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 06:57:36,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 06:57:36,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 06:57:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 06:57:36,214 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 06:57:36,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 06:57:37,160 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 06:57:37,161 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 06:57:37,247 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 06:57:37,247 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 06:57:37,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:37 BoogieIcfgContainer [2024-10-24 06:57:37,248 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 06:57:37,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 06:57:37,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 06:57:37,257 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 06:57:37,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:57:35" (1/3) ... [2024-10-24 06:57:37,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fa3a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:57:37, skipping insertion in model container [2024-10-24 06:57:37,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:57:35" (2/3) ... [2024-10-24 06:57:37,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31fa3a21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:57:37, skipping insertion in model container [2024-10-24 06:57:37,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:57:37" (3/3) ... [2024-10-24 06:57:37,262 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-61.i [2024-10-24 06:57:37,279 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 06:57:37,280 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 06:57:37,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 06:57:37,369 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;@660d9c08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 06:57:37,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 06:57:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:37,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 06:57:37,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:37,394 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:37,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:37,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1907523825, now seen corresponding path program 1 times [2024-10-24 06:57:37,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:57:37,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112328876] [2024-10-24 06:57:37,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:37,422 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 06:57:37,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:57:37,426 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 06:57:37,428 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 06:57:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:37,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 06:57:37,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:57:37,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-10-24 06:57:37,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:57:37,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:57:37,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112328876] [2024-10-24 06:57:37,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112328876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:37,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:37,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 06:57:37,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107983438] [2024-10-24 06:57:37,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:37,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 06:57:37,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:57:37,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 06:57:37,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 06:57:37,957 INFO L87 Difference]: Start difference. First operand has 78 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:57:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:38,088 INFO L93 Difference]: Finished difference Result 153 states and 276 transitions. [2024-10-24 06:57:38,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 06:57:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-10-24 06:57:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:38,107 INFO L225 Difference]: With dead ends: 153 [2024-10-24 06:57:38,107 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 06:57:38,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 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 06:57:38,114 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:38,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 06:57:38,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 06:57:38,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 06:57:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.48) internal successors, (74), 50 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2024-10-24 06:57:38,175 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 157 [2024-10-24 06:57:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:38,176 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2024-10-24 06:57:38,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-24 06:57:38,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2024-10-24 06:57:38,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 06:57:38,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:38,179 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:38,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 06:57:38,380 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 06:57:38,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:38,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:38,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1096666037, now seen corresponding path program 1 times [2024-10-24 06:57:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:57:38,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094748077] [2024-10-24 06:57:38,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:38,383 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 06:57:38,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:57:38,387 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 06:57:38,388 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 06:57:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:38,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 06:57:38,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:57:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:39,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:57:39,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:57:39,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094748077] [2024-10-24 06:57:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094748077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 06:57:39,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289316340] [2024-10-24 06:57:39,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:39,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 06:57:39,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:57:39,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 06:57:39,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 06:57:39,300 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:40,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:40,071 INFO L93 Difference]: Finished difference Result 255 states and 413 transitions. [2024-10-24 06:57:40,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 06:57:40,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-24 06:57:40,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:40,083 INFO L225 Difference]: With dead ends: 255 [2024-10-24 06:57:40,083 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 06:57:40,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 06:57:40,085 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 125 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:40,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 474 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 06:57:40,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 06:57:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149. [2024-10-24 06:57:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 98 states have (on average 1.469387755102041) internal successors, (144), 98 states have internal predecessors, (144), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 06:57:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 240 transitions. [2024-10-24 06:57:40,144 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 240 transitions. Word has length 157 [2024-10-24 06:57:40,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:40,147 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 240 transitions. [2024-10-24 06:57:40,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 240 transitions. [2024-10-24 06:57:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 06:57:40,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:40,151 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:40,162 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 06:57:40,352 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 06:57:40,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:40,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:40,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1315520755, now seen corresponding path program 1 times [2024-10-24 06:57:40,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:57:40,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957930011] [2024-10-24 06:57:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:40,355 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 06:57:40,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:57:40,359 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 06:57:40,360 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 06:57:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:40,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 06:57:40,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 06:57:41,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-24 06:57:41,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 06:57:41,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 06:57:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957930011] [2024-10-24 06:57:41,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957930011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 06:57:41,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 06:57:41,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 06:57:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085533718] [2024-10-24 06:57:41,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 06:57:41,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 06:57:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 06:57:41,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 06:57:41,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:57:41,149 INFO L87 Difference]: Start difference. First operand 149 states and 240 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 06:57:41,656 INFO L93 Difference]: Finished difference Result 151 states and 241 transitions. [2024-10-24 06:57:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 06:57:41,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-24 06:57:41,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 06:57:41,669 INFO L225 Difference]: With dead ends: 151 [2024-10-24 06:57:41,669 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 06:57:41,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 06:57:41,671 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 06:57:41,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 172 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 06:57:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 06:57:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 06:57:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 06:57:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2024-10-24 06:57:41,696 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 157 [2024-10-24 06:57:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 06:57:41,696 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2024-10-24 06:57:41,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-24 06:57:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2024-10-24 06:57:41,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 06:57:41,699 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 06:57:41,700 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:57:41,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 06:57:41,903 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 06:57:41,904 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 06:57:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 06:57:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash -676776909, now seen corresponding path program 1 times [2024-10-24 06:57:41,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 06:57:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102721795] [2024-10-24 06:57:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 06:57:41,906 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 06:57:41,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 06:57:41,910 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 06:57:41,911 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 06:57:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 06:57:42,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 06:57:42,231 INFO L278 TraceCheckSpWp]: Computing forward predicates...