./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-1loop_file-24.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-1loop_file-24.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 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:25:38,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:25:38,166 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:25:38,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:25:38,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:25:38,195 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:25:38,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:25:38,196 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:25:38,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:25:38,197 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:25:38,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:25:38,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:25:38,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:25:38,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:25:38,199 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:25:38,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:25:38,200 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:25:38,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:25:38,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:25:38,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:25:38,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:25:38,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:25:38,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:25:38,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:25:38,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:25:38,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:25:38,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:25:38,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:25:38,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:25:38,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:25:38,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:25:38,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:25:38,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:25:38,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:25:38,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:25:38,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:25:38,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:25:38,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:25:38,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:25:38,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:25:38,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:25:38,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:25:38,213 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 -> 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 [2024-10-11 11:25:38,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:25:38,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:25:38,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:25:38,502 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:25:38,503 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:25:38,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-11 11:25:40,025 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:25:40,238 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:25:40,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-11 11:25:40,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/15ca77cfe/aeba02c7f8dc495888392a3ad7c06f13/FLAGcbc957af2 [2024-10-11 11:25:40,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/15ca77cfe/aeba02c7f8dc495888392a3ad7c06f13 [2024-10-11 11:25:40,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:25:40,272 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:25:40,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:25:40,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:25:40,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:25:40,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,284 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cc1dde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40, skipping insertion in model container [2024-10-11 11:25:40,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:25:40,478 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-1loop_file-24.i[915,928] [2024-10-11 11:25:40,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:25:40,565 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:25:40,577 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-1loop_file-24.i[915,928] [2024-10-11 11:25:40,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:25:40,634 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:25:40,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40 WrapperNode [2024-10-11 11:25:40,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:25:40,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:25:40,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:25:40,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:25:40,644 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:25:40" (1/1) ... [2024-10-11 11:25:40,654 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:25:40" (1/1) ... [2024-10-11 11:25:40,690 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-11 11:25:40,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:25:40,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:25:40,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:25:40,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:25:40,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,721 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:25:40,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,731 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,739 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:25:40,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:25:40,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:25:40,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:25:40,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (1/1) ... [2024-10-11 11:25:40,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:25:40,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:25:40,796 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:25:40,800 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:25:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:25:40,856 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:25:40,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:25:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:25:40,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:25:40,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:25:40,935 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:25:40,938 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:25:41,218 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 11:25:41,218 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:25:41,260 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:25:41,261 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:25:41,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:41 BoogieIcfgContainer [2024-10-11 11:25:41,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:25:41,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:25:41,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:25:41,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:25:41,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:25:40" (1/3) ... [2024-10-11 11:25:41,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b68a468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:25:41, skipping insertion in model container [2024-10-11 11:25:41,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:40" (2/3) ... [2024-10-11 11:25:41,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b68a468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:25:41, skipping insertion in model container [2024-10-11 11:25:41,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:41" (3/3) ... [2024-10-11 11:25:41,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-11 11:25:41,293 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:25:41,293 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:25:41,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:25:41,394 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;@15b5c848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:25:41,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:25:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 11:25:41,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:25:41,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:41,411 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:41,412 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:41,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1158333792, now seen corresponding path program 1 times [2024-10-11 11:25:41,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:41,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443090549] [2024-10-11 11:25:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:25:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:25:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:25:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:25:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:25:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:25:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:25:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:25:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:25:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:25:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:25:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:25:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:25:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:25:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:25:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 11:25:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:25:41,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443090549] [2024-10-11 11:25:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443090549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:41,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:25:41,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501235175] [2024-10-11 11:25:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:41,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:25:41,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:25:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:25:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:25:41,810 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 11:25:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:41,848 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2024-10-11 11:25:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:25:41,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2024-10-11 11:25:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:41,860 INFO L225 Difference]: With dead ends: 83 [2024-10-11 11:25:41,861 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 11:25:41,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:25:41,868 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:41,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:25:41,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 11:25:41,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 11:25:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 11:25:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-11 11:25:41,904 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 92 [2024-10-11 11:25:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:41,905 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-11 11:25:41,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 11:25:41,905 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-11 11:25:41,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:25:41,909 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:41,909 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:41,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:25:41,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:41,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:41,911 INFO L85 PathProgramCache]: Analyzing trace with hash 669175970, now seen corresponding path program 1 times [2024-10-11 11:25:41,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:25:41,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173696802] [2024-10-11 11:25:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:41,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:25:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:25:42,098 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:25:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:25:42,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:25:42,248 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:25:42,250 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:25:42,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:25:42,258 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 11:25:42,326 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:25:42,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:25:42 BoogieIcfgContainer [2024-10-11 11:25:42,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:25:42,331 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:25:42,331 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:25:42,331 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:25:42,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:41" (3/4) ... [2024-10-11 11:25:42,334 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:25:42,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:25:42,338 INFO L158 Benchmark]: Toolchain (without parser) took 2064.16ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 109.5MB in the beginning and 171.5MB in the end (delta: -62.0MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2024-10-11 11:25:42,341 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 161.5MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:25:42,342 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.42ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 94.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:25:42,342 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.57ms. Allocated memory is still 161.5MB. Free memory was 94.4MB in the beginning and 91.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:25:42,345 INFO L158 Benchmark]: Boogie Preprocessor took 54.22ms. Allocated memory is still 161.5MB. Free memory was 91.6MB in the beginning and 87.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:25:42,345 INFO L158 Benchmark]: RCFGBuilder took 514.88ms. Allocated memory is still 161.5MB. Free memory was 87.4MB in the beginning and 68.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:25:42,346 INFO L158 Benchmark]: TraceAbstraction took 1066.17ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 67.6MB in the beginning and 172.5MB in the end (delta: -104.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:25:42,346 INFO L158 Benchmark]: Witness Printer took 4.93ms. Allocated memory is still 257.9MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:25:42,352 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 161.5MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.42ms. Allocated memory is still 161.5MB. Free memory was 109.0MB in the beginning and 94.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.57ms. Allocated memory is still 161.5MB. Free memory was 94.4MB in the beginning and 91.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.22ms. Allocated memory is still 161.5MB. Free memory was 91.6MB in the beginning and 87.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.88ms. Allocated memory is still 161.5MB. Free memory was 87.4MB in the beginning and 68.0MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1066.17ms. Allocated memory was 161.5MB in the beginning and 257.9MB in the end (delta: 96.5MB). Free memory was 67.6MB in the beginning and 172.5MB in the end (delta: -104.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.93ms. Allocated memory is still 257.9MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 127.1; [L25] signed char var_1_4 = 16; [L26] signed char var_1_5 = 4; [L27] unsigned char var_1_6 = 8; [L28] float var_1_7 = 1000000.6; [L29] unsigned char var_1_8 = 64; [L30] unsigned char var_1_9 = 64; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 32; [L33] float var_1_12 = 16.8; [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L95] COND TRUE k_loop < 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_3=1271/10, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L63] var_1_3 = __VERIFIER_nondet_float() [L64] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L64] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=16, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L65] var_1_4 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L66] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L67] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L67] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=4, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L68] var_1_5 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L69] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L70] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L70] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_7=5000003/5, var_1_8=64, var_1_9=64] [L71] var_1_7 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=64, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=64, var_1_9=64] [L72] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=64, var_1_9=64] [L73] var_1_8 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L74] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L75] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L75] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=64] [L76] var_1_9 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_9 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L77] RET assume_abort_if_not(var_1_9 >= 64) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L78] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L78] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=128, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L79] var_1_10 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L80] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L81] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L81] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_12=84/5, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L82] var_1_12 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=32, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L83] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=32, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L97] RET updateVariables() [L98] CALL step() [L37] COND FALSE !(var_1_2 || (64.75f < var_1_3)) [L44] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=8, var_1_8=127, var_1_9=127] [L46] COND TRUE var_1_3 <= var_1_7 [L47] var_1_6 = ((((((var_1_8 + var_1_9)) > (((((var_1_10) > (200)) ? (var_1_10) : (200))))) ? ((var_1_8 + var_1_9)) : (((((var_1_10) > (200)) ? (var_1_10) : (200)))))) - var_1_5) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] [L51] COND FALSE !(((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))) <= var_1_10) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((var_1_2 || (64.75f < var_1_3)) ? (var_1_2 ? (var_1_1 == ((signed char) (var_1_4 - var_1_5))) : (var_1_1 == ((signed char) var_1_4))) : (var_1_1 == ((signed char) var_1_5))) && ((var_1_3 <= var_1_7) ? (var_1_6 == ((unsigned char) ((((((var_1_8 + var_1_9)) > (((((var_1_10) > (200)) ? (var_1_10) : (200))))) ? ((var_1_8 + var_1_9)) : (((((var_1_10) > (200)) ? (var_1_10) : (200)))))) - var_1_5))) : (var_1_6 == ((unsigned char) var_1_10)))) && ((((((var_1_6) > (var_1_8)) ? (var_1_6) : (var_1_8))) <= var_1_10) ? ((var_1_3 == (var_1_7 + var_1_12)) ? (var_1_11 == ((unsigned char) (var_1_9 + var_1_5))) : (var_1_11 == ((unsigned char) var_1_9))) : 1) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=127, var_1_11=32, var_1_1=126, var_1_2=0, var_1_4=125, var_1_5=126, var_1_6=128, var_1_8=127, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 91 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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:25:42,389 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-1loop_file-24.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 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:25:44,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:25:44,810 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:25:44,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:25:44,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:25:44,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:25:44,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:25:44,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:25:44,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:25:44,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:25:44,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:25:44,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:25:44,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:25:44,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:25:44,864 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:25:44,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:25:44,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:25:44,866 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:25:44,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:25:44,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:25:44,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:25:44,870 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:25:44,870 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:25:44,871 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:25:44,871 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:25:44,871 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:25:44,871 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:25:44,871 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:25:44,872 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:25:44,872 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:25:44,872 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:25:44,872 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:25:44,872 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:25:44,873 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:25:44,873 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:25:44,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:25:44,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:25:44,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:25:44,876 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:25:44,877 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:25:44,877 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:25:44,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:25:44,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:25:44,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:25:44,878 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:25:44,878 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 -> 1c6c11b57806b00201b98326e672a3344df9212139d60f788fa43f0ecfa41035 [2024-10-11 11:25:45,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:25:45,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:25:45,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:25:45,238 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:25:45,239 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:25:45,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-11 11:25:46,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:25:47,129 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:25:47,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-11 11:25:47,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43de24c25/b419e78dd4b140aa912957e43a388dd2/FLAG48a3e9fbe [2024-10-11 11:25:47,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/43de24c25/b419e78dd4b140aa912957e43a388dd2 [2024-10-11 11:25:47,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:25:47,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:25:47,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:25:47,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:25:47,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:25:47,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6114592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47, skipping insertion in model container [2024-10-11 11:25:47,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:25:47,398 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-1loop_file-24.i[915,928] [2024-10-11 11:25:47,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:25:47,483 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:25:47,497 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-1loop_file-24.i[915,928] [2024-10-11 11:25:47,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:25:47,550 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:25:47,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47 WrapperNode [2024-10-11 11:25:47,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:25:47,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:25:47,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:25:47,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:25:47,558 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:25:47" (1/1) ... [2024-10-11 11:25:47,574 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:25:47" (1/1) ... [2024-10-11 11:25:47,609 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-11 11:25:47,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:25:47,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:25:47,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:25:47,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:25:47,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,649 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:25:47,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,659 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:25:47,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:25:47,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:25:47,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:25:47,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (1/1) ... [2024-10-11 11:25:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:25:47,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:25:47,709 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:25:47,712 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:25:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:25:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:25:47,763 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:25:47,763 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:25:47,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:25:47,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:25:47,866 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:25:47,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:25:48,329 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 11:25:48,330 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:25:48,387 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:25:48,387 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:25:48,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:48 BoogieIcfgContainer [2024-10-11 11:25:48,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:25:48,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:25:48,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:25:48,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:25:48,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:25:47" (1/3) ... [2024-10-11 11:25:48,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14559d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:25:48, skipping insertion in model container [2024-10-11 11:25:48,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:25:47" (2/3) ... [2024-10-11 11:25:48,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14559d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:25:48, skipping insertion in model container [2024-10-11 11:25:48,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:25:48" (3/3) ... [2024-10-11 11:25:48,397 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-24.i [2024-10-11 11:25:48,414 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:25:48,414 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:25:48,492 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:25:48,500 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;@29282851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:25:48,500 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:25:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 11:25:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:25:48,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:48,520 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:48,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:48,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1158333792, now seen corresponding path program 1 times [2024-10-11 11:25:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:25:48,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597838211] [2024-10-11 11:25:48,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:48,541 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:25:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:25:48,545 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:25:48,546 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:25:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:48,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:25:48,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:25:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-11 11:25:48,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:25:48,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:25:48,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597838211] [2024-10-11 11:25:48,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597838211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:25:48,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:25:48,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:25:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233019684] [2024-10-11 11:25:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:25:48,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:25:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:25:48,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:25:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:25:48,889 INFO L87 Difference]: Start difference. First operand has 42 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 11:25:49,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:25:49,011 INFO L93 Difference]: Finished difference Result 83 states and 142 transitions. [2024-10-11 11:25:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:25:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 92 [2024-10-11 11:25:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:25:49,025 INFO L225 Difference]: With dead ends: 83 [2024-10-11 11:25:49,025 INFO L226 Difference]: Without dead ends: 40 [2024-10-11 11:25:49,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:25:49,033 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:25:49,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:25:49,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-11 11:25:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-10-11 11:25:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 11:25:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2024-10-11 11:25:49,089 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 92 [2024-10-11 11:25:49,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:25:49,089 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2024-10-11 11:25:49,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 11:25:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2024-10-11 11:25:49,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:25:49,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:25:49,094 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:49,106 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:25:49,295 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:25:49,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:25:49,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:25:49,297 INFO L85 PathProgramCache]: Analyzing trace with hash 669175970, now seen corresponding path program 1 times [2024-10-11 11:25:49,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:25:49,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259050724] [2024-10-11 11:25:49,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:25:49,298 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:25:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:25:49,302 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:25:49,303 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:25:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:25:49,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:25:49,531 INFO L278 TraceCheckSpWp]: Computing forward predicates...