./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:39:50,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:39:50,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:39:50,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:39:50,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:39:50,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:39:50,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:39:50,245 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:39:50,246 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:39:50,248 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:39:50,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:39:50,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:39:50,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:39:50,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:39:50,249 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:39:50,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:39:50,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:39:50,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:39:50,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:39:50,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:39:50,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:39:50,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:39:50,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:39:50,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:39:50,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:39:50,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:39:50,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:39:50,257 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:39:50,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:39:50,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:39:50,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:39:50,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:39:50,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:39:50,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:39:50,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:39:50,259 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:39:50,259 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:39:50,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:39:50,260 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:39:50,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:39:50,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:39:50,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:39:50,262 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 [2024-10-11 11:39:50,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:39:50,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:39:50,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:39:50,539 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:39:50,539 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:39:50,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-11 11:39:52,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:39:52,339 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:39:52,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-11 11:39:52,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b34247c99/ab4e71bb3fa546c0b2604123fab783f0/FLAGbdd29dd85 [2024-10-11 11:39:52,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b34247c99/ab4e71bb3fa546c0b2604123fab783f0 [2024-10-11 11:39:52,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:39:52,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:39:52,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:39:52,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:39:52,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:39:52,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:39:52" (1/1) ... [2024-10-11 11:39:52,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581b63c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:52, skipping insertion in model container [2024-10-11 11:39:52,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:39:52" (1/1) ... [2024-10-11 11:39:52,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:39:52,939 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-11 11:39:52,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:39:53,005 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:39:53,018 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-11 11:39:53,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:39:53,059 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:39:53,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53 WrapperNode [2024-10-11 11:39:53,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:39:53,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:39:53,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:39:53,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:39:53,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,106 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2024-10-11 11:39:53,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:39:53,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:39:53,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:39:53,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:39:53,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,137 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:39:53,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,148 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:39:53,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:39:53,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:39:53,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:39:53,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (1/1) ... [2024-10-11 11:39:53,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:39:53,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:39:53,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:39:53,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:39:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:39:53,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:39:53,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:39:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:39:53,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:39:53,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:39:53,310 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:39:53,313 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:39:53,595 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 11:39:53,595 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:39:53,668 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:39:53,669 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:39:53,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:39:53 BoogieIcfgContainer [2024-10-11 11:39:53,670 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:39:53,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:39:53,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:39:53,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:39:53,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:39:52" (1/3) ... [2024-10-11 11:39:53,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df32d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:39:53, skipping insertion in model container [2024-10-11 11:39:53,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:39:53" (2/3) ... [2024-10-11 11:39:53,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4df32d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:39:53, skipping insertion in model container [2024-10-11 11:39:53,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:39:53" (3/3) ... [2024-10-11 11:39:53,681 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-11 11:39:53,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:39:53,701 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:39:53,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:39:53,785 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;@15060cc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:39:53,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:39:53,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:39:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 11:39:53,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:39:53,807 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:39:53,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:39:53,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:39:53,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1817537960, now seen corresponding path program 1 times [2024-10-11 11:39:53,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:39:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032112823] [2024-10-11 11:39:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:39:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:39:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:39:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:39:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:39:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:39:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:39:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:39:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:39:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:39:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:39:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:39:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:39:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:39:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:39:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:39:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:39:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:39:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:39:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:39:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:39:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:39:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:39:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:39:54,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:39:54,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032112823] [2024-10-11 11:39:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032112823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:39:54,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:39:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:39:54,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881934505] [2024-10-11 11:39:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:39:54,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:39:54,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:39:54,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:39:54,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:39:54,357 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 11:39:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:39:54,428 INFO L93 Difference]: Finished difference Result 105 states and 183 transitions. [2024-10-11 11:39:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:39:54,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-11 11:39:54,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:39:54,443 INFO L225 Difference]: With dead ends: 105 [2024-10-11 11:39:54,443 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 11:39:54,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:39:54,452 INFO L432 NwaCegarLoop]: 73 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, 73 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:39:54,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:39:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 11:39:54,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 11:39:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:39:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-11 11:39:54,519 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 128 [2024-10-11 11:39:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:39:54,522 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-11 11:39:54,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 11:39:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-11 11:39:54,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 11:39:54,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:39:54,526 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:39:54,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:39:54,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:39:54,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:39:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash 208803318, now seen corresponding path program 1 times [2024-10-11 11:39:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:39:54,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927403386] [2024-10-11 11:39:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:39:54,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:39:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:39:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:39:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:39:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:39:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:39:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:39:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:39:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:39:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:39:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:39:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:39:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:39:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:39:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:39:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:39:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:39:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:39:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:39:54,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:39:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 11:39:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 11:39:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:39:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:39:54,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:39:54,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927403386] [2024-10-11 11:39:54,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927403386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:39:54,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:39:54,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:39:54,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842797881] [2024-10-11 11:39:54,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:39:54,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:39:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:39:54,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:39:55,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:39:55,001 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:39:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:39:55,040 INFO L93 Difference]: Finished difference Result 103 states and 151 transitions. [2024-10-11 11:39:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:39:55,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-11 11:39:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:39:55,043 INFO L225 Difference]: With dead ends: 103 [2024-10-11 11:39:55,043 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 11:39:55,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:39:55,045 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:39:55,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:39:55,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 11:39:55,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 11:39:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:39:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-11 11:39:55,063 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 128 [2024-10-11 11:39:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:39:55,066 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-11 11:39:55,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:39:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-11 11:39:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 11:39:55,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:39:55,072 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:39:55,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:39:55,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:39:55,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:39:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2126795466, now seen corresponding path program 1 times [2024-10-11 11:39:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:39:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015923164] [2024-10-11 11:39:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:39:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:39:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:39:55,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:39:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:39:55,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:39:55,367 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:39:55,369 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:39:55,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:39:55,374 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:39:55,479 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:39:55,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:39:55 BoogieIcfgContainer [2024-10-11 11:39:55,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:39:55,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:39:55,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:39:55,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:39:55,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:39:53" (3/4) ... [2024-10-11 11:39:55,490 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:39:55,492 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:39:55,494 INFO L158 Benchmark]: Toolchain (without parser) took 2781.18ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 119.5MB in the beginning and 93.7MB in the end (delta: 25.8MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-10-11 11:39:55,497 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 176.2MB. Free memory was 138.8MB in the beginning and 138.6MB in the end (delta: 277.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:39:55,498 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.93ms. Allocated memory is still 176.2MB. Free memory was 119.5MB in the beginning and 104.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:39:55,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.01ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:39:55,498 INFO L158 Benchmark]: Boogie Preprocessor took 45.73ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 99.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:39:55,499 INFO L158 Benchmark]: RCFGBuilder took 515.54ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 80.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:39:55,499 INFO L158 Benchmark]: TraceAbstraction took 1813.96ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 79.6MB in the beginning and 94.7MB in the end (delta: -15.1MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. [2024-10-11 11:39:55,499 INFO L158 Benchmark]: Witness Printer took 5.82ms. Allocated memory is still 222.3MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:39:55,501 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.19ms. Allocated memory is still 176.2MB. Free memory was 138.8MB in the beginning and 138.6MB in the end (delta: 277.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.93ms. Allocated memory is still 176.2MB. Free memory was 119.5MB in the beginning and 104.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.01ms. Allocated memory is still 176.2MB. Free memory was 104.3MB in the beginning and 102.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.73ms. Allocated memory is still 176.2MB. Free memory was 102.2MB in the beginning and 99.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 515.54ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 80.4MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1813.96ms. Allocated memory was 176.2MB in the beginning and 222.3MB in the end (delta: 46.1MB). Free memory was 79.6MB in the beginning and 94.7MB in the end (delta: -15.1MB). Peak memory consumption was 33.1MB. Max. memory is 16.1GB. * Witness Printer took 5.82ms. Allocated memory is still 222.3MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] signed long int var_1_4 = -32; [L24] signed long int var_1_5 = 10; [L25] signed long int var_1_6 = -1; [L26] unsigned long int var_1_7 = 25; [L27] unsigned char var_1_8 = 1; [L28] unsigned long int var_1_9 = 2; [L29] unsigned long int var_1_10 = 32; [L30] unsigned long int var_1_11 = 128; [L31] float var_1_12 = 24.2; [L32] double var_1_13 = 999999999999999.2; [L33] double var_1_14 = 9999999.6; [L34] double var_1_15 = 9.75; [L35] float var_1_16 = 999999999999999.4; [L36] float var_1_17 = 256.6; [L37] float var_1_18 = 8.875; [L38] float var_1_19 = 256.25; [L39] signed long int last_1_var_1_1 = -128; [L40] unsigned long int last_1_var_1_7 = 25; [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] last_1_var_1_1 = var_1_1 [L108] last_1_var_1_7 = var_1_7 [L118] RET updateLastVariables() [L119] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_4 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_4 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] CALL assume_abort_if_not(var_1_4 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] RET assume_abort_if_not(var_1_4 <= 536870912) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L73] var_1_5 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L76] var_1_6 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_6 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L77] RET assume_abort_if_not(var_1_6 >= -1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L78] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=1, var_1_9=2] [L79] var_1_8 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_9=2] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_9=2] [L81] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=2] [L81] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=2] [L82] var_1_9 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0] [L84] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L85] var_1_10 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L88] var_1_11 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L91] var_1_13 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L97] var_1_16 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L99] var_1_17 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L101] var_1_18 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L103] var_1_19 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=-128, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L119] RET updateVariables() [L120] CALL step() [L44] COND TRUE ((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1) [L45] var_1_1 = ((var_1_4 + var_1_5) + var_1_6) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=0] [L49] COND FALSE !(\read(var_1_8)) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L58] unsigned long int stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND TRUE var_1_7 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=121/5, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L60] COND TRUE (var_1_13 - var_1_14) == var_1_15 [L61] var_1_12 = ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return (((((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1)) ? (var_1_1 == ((signed long int) ((var_1_4 + var_1_5) + var_1_6))) : (var_1_1 == ((signed long int) var_1_6))) && (var_1_8 ? ((var_1_1 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_9) > (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (var_1_9) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_7 == ((unsigned long int) var_1_10))) : (var_1_7 == ((unsigned long int) var_1_11)))) && ((var_1_7 <= var_1_7) ? (((var_1_13 - var_1_14) == var_1_15) ? (var_1_12 == ((float) ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))))) : (var_1_12 == ((float) var_1_19))) : (var_1_12 == ((float) var_1_16))) ; [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=0, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=536870910, var_1_5=-536870911, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 144 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 264 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1680/1680 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:39:55,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:39:57,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:39:57,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:39:57,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:39:57,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:39:57,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:39:57,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:39:57,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:39:57,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:39:57,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:39:57,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:39:57,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:39:57,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:39:57,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:39:57,944 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:39:57,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:39:57,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:39:57,945 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:39:57,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:39:57,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:39:57,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:39:57,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:39:57,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:39:57,950 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:39:57,950 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:39:57,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:39:57,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:39:57,951 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:39:57,951 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:39:57,951 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:39:57,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:39:57,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:39:57,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:39:57,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:39:57,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:39:57,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:39:57,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:39:57,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:39:57,953 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:39:57,953 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:39:57,955 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:39:57,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:39:57,956 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:39:57,956 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:39:57,957 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:39:57,957 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2e7bc86c416f082f6cbd3468de78760603e8d7fefbcdca8dd6e4ac6b460db48 [2024-10-11 11:39:58,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:39:58,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:39:58,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:39:58,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:39:58,344 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:39:58,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-11 11:39:59,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:40:00,057 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:40:00,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-11 11:40:00,071 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/335d66f64/13d56b12ebae40d7b3001f2dc097d396/FLAGbbdba7cc8 [2024-10-11 11:40:00,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/335d66f64/13d56b12ebae40d7b3001f2dc097d396 [2024-10-11 11:40:00,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:40:00,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:40:00,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:40:00,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:40:00,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:40:00,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9f8159 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00, skipping insertion in model container [2024-10-11 11:40:00,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:40:00,318 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-11 11:40:00,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:40:00,401 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:40:00,413 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-59.i[915,928] [2024-10-11 11:40:00,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:40:00,473 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:40:00,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00 WrapperNode [2024-10-11 11:40:00,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:40:00,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:40:00,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:40:00,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:40:00,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,526 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-11 11:40:00,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:40:00,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:40:00,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:40:00,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:40:00,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,576 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:40:00,580 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,580 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:40:00,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:40:00,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:40:00,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:40:00,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (1/1) ... [2024-10-11 11:40:00,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:40:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:40:00,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:40:00,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:40:00,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:40:00,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:40:00,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:40:00,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:40:00,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:40:00,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:40:00,817 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:40:00,820 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:40:02,705 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 11:40:02,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:40:02,789 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:40:02,790 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:40:02,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:40:02 BoogieIcfgContainer [2024-10-11 11:40:02,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:40:02,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:40:02,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:40:02,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:40:02,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:40:00" (1/3) ... [2024-10-11 11:40:02,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579ab498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:40:02, skipping insertion in model container [2024-10-11 11:40:02,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:40:00" (2/3) ... [2024-10-11 11:40:02,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579ab498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:40:02, skipping insertion in model container [2024-10-11 11:40:02,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:40:02" (3/3) ... [2024-10-11 11:40:02,800 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-59.i [2024-10-11 11:40:02,818 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:40:02,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:40:02,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:40:02,891 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;@7e40436f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:40:02,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:40:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:40:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 11:40:02,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:02,912 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:02,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:02,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1817537960, now seen corresponding path program 1 times [2024-10-11 11:40:02,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:40:02,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821811063] [2024-10-11 11:40:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:02,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:02,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:40:02,941 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:40:02,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:40:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:03,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:40:03,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:40:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2024-10-11 11:40:03,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:40:03,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:40:03,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821811063] [2024-10-11 11:40:03,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821811063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:40:03,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:40:03,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:40:03,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583461394] [2024-10-11 11:40:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:40:03,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:40:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:40:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:40:03,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:40:03,368 INFO L87 Difference]: Start difference. First operand has 54 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 11:40:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:40:04,146 INFO L93 Difference]: Finished difference Result 105 states and 183 transitions. [2024-10-11 11:40:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:40:04,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2024-10-11 11:40:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:40:04,165 INFO L225 Difference]: With dead ends: 105 [2024-10-11 11:40:04,166 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 11:40:04,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:40:04,172 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:40:04,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 11:40:04,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 11:40:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 11:40:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:40:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-10-11 11:40:04,217 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 128 [2024-10-11 11:40:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:40:04,218 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-10-11 11:40:04,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-11 11:40:04,218 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-10-11 11:40:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 11:40:04,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:04,221 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:04,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:40:04,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:04,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 208803318, now seen corresponding path program 1 times [2024-10-11 11:40:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:40:04,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275133387] [2024-10-11 11:40:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:04,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:40:04,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:40:04,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:40:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:04,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:40:04,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:40:04,851 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-11 11:40:04,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:40:04,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:40:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275133387] [2024-10-11 11:40:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275133387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:40:04,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:40:04,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:40:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498248365] [2024-10-11 11:40:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:40:04,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:40:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:40:04,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:40:04,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:40:04,856 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:40:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:40:05,649 INFO L93 Difference]: Finished difference Result 103 states and 151 transitions. [2024-10-11 11:40:05,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:40:05,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 128 [2024-10-11 11:40:05,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:40:05,668 INFO L225 Difference]: With dead ends: 103 [2024-10-11 11:40:05,668 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 11:40:05,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:40:05,670 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:40:05,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:40:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 11:40:05,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 11:40:05,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 11:40:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-11 11:40:05,681 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 128 [2024-10-11 11:40:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:40:05,682 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-11 11:40:05,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-11 11:40:05,683 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-11 11:40:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 11:40:05,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:40:05,687 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:40:05,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 11:40:05,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:05,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:40:05,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:40:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2126795466, now seen corresponding path program 1 times [2024-10-11 11:40:05,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:40:05,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831484136] [2024-10-11 11:40:05,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:40:05,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:40:05,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:40:05,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:40:05,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:40:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:40:06,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 11:40:06,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:41:03,927 WARN L286 SmtUtils]: Spent 14.94s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)