./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-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:50:43,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:50:43,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:50:43,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:50:43,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:50:43,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:50:43,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:50:43,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:50:43,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:50:43,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:50:43,168 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:50:43,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:50:43,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:50:43,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:50:43,170 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:50:43,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:50:43,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:50:43,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:50:43,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:50:43,171 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:50:43,171 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:50:43,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:50:43,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:50:43,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:50:43,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:50:43,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:50:43,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:50:43,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:50:43,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:50:43,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:50:43,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:50:43,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:50:43,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:50:43,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:50:43,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:50:43,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:50:43,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:50:43,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:50:43,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:50:43,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:50:43,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:50:43,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:50:43,180 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c [2024-10-14 11:50:43,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:50:43,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:50:43,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:50:43,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:50:43,435 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:50:43,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-10-14 11:50:44,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:50:44,983 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:50:44,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-10-14 11:50:44,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b187c74db/e1d319de76524140a31ade0ef444d1fd/FLAG1cfdfe1a4 [2024-10-14 11:50:45,001 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b187c74db/e1d319de76524140a31ade0ef444d1fd [2024-10-14 11:50:45,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:50:45,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:50:45,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:50:45,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:50:45,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:50:45,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305bbec0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45, skipping insertion in model container [2024-10-14 11:50:45,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:50:45,135 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-83.i[915,928] [2024-10-14 11:50:45,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:50:45,178 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:50:45,186 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-83.i[915,928] [2024-10-14 11:50:45,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:50:45,213 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:50:45,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45 WrapperNode [2024-10-14 11:50:45,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:50:45,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:50:45,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:50:45,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:50:45,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,232 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,271 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-14 11:50:45,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:50:45,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:50:45,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:50:45,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:50:45,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,302 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-14 11:50:45,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:50:45,325 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:50:45,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:50:45,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:50:45,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (1/1) ... [2024-10-14 11:50:45,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:50:45,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:50:45,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:50:45,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:50:45,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:50:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:50:45,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:50:45,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:50:45,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:50:45,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:50:45,471 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:50:45,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:50:45,689 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 11:50:45,690 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:50:45,727 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:50:45,729 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:50:45,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:45 BoogieIcfgContainer [2024-10-14 11:50:45,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:50:45,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:50:45,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:50:45,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:50:45,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:45" (1/3) ... [2024-10-14 11:50:45,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1127fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:45, skipping insertion in model container [2024-10-14 11:50:45,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:45" (2/3) ... [2024-10-14 11:50:45,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1127fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:45, skipping insertion in model container [2024-10-14 11:50:45,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:45" (3/3) ... [2024-10-14 11:50:45,775 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-83.i [2024-10-14 11:50:45,822 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:50:45,823 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:50:45,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:50:45,880 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;@4e9515e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:50:45,881 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:50:45,883 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 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-14 11:50:45,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 11:50:45,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:50:45,895 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] [2024-10-14 11:50:45,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:50:45,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:50:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 43849795, now seen corresponding path program 1 times [2024-10-14 11:50:45,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:50:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028081159] [2024-10-14 11:50:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:50:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:50:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:50:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:50:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:50:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:50:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:50:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:50:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 11:50:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:50:46,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:50:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 11:50:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:50:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 11:50:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:50:46,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 11:50:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:50:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:46,183 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-14 11:50:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:50:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028081159] [2024-10-14 11:50:46,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028081159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:50:46,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:50:46,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:50:46,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491638810] [2024-10-14 11:50:46,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:50:46,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:50:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:50:46,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:50:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:50:46,220 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 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) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-14 11:50:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:50:46,253 INFO L93 Difference]: Finished difference Result 75 states and 131 transitions. [2024-10-14 11:50:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:50:46,256 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 90 [2024-10-14 11:50:46,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:50:46,260 INFO L225 Difference]: With dead ends: 75 [2024-10-14 11:50:46,264 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 11:50:46,267 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-14 11:50:46,273 INFO L432 NwaCegarLoop]: 51 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, 51 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-14 11:50:46,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:50:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 11:50:46,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 11:50:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-14 11:50:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-14 11:50:46,306 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 90 [2024-10-14 11:50:46,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:50:46,306 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-14 11:50:46,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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-14 11:50:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-14 11:50:46,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 11:50:46,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:50:46,309 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] [2024-10-14 11:50:46,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:50:46,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:50:46,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:50:46,310 INFO L85 PathProgramCache]: Analyzing trace with hash -756259331, now seen corresponding path program 1 times [2024-10-14 11:50:46,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:50:46,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413098526] [2024-10-14 11:50:46,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:50:46,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:50:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:50:46,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1299591618] [2024-10-14 11:50:46,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:50:46,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:50:46,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:50:46,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:50:46,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 11:50:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:50:46,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:50:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:50:46,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:50:46,639 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:50:46,640 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:50:46,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 11:50:46,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:50:46,846 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-14 11:50:46,902 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:50:46,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:50:46 BoogieIcfgContainer [2024-10-14 11:50:46,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:50:46,905 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:50:46,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:50:46,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:50:46,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:45" (3/4) ... [2024-10-14 11:50:46,907 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:50:46,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:50:46,909 INFO L158 Benchmark]: Toolchain (without parser) took 1904.42ms. Allocated memory is still 169.9MB. Free memory was 114.8MB in the beginning and 77.3MB in the end (delta: 37.5MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-10-14 11:50:46,909 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 169.9MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:50:46,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.21ms. Allocated memory is still 169.9MB. Free memory was 114.4MB in the beginning and 101.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 11:50:46,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.11ms. Allocated memory is still 169.9MB. Free memory was 101.2MB in the beginning and 97.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 11:50:46,910 INFO L158 Benchmark]: Boogie Preprocessor took 51.92ms. Allocated memory is still 169.9MB. Free memory was 97.6MB in the beginning and 92.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:50:46,910 INFO L158 Benchmark]: RCFGBuilder took 404.70ms. Allocated memory is still 169.9MB. Free memory was 92.3MB in the beginning and 72.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-14 11:50:46,911 INFO L158 Benchmark]: TraceAbstraction took 1171.58ms. Allocated memory is still 169.9MB. Free memory was 71.8MB in the beginning and 77.3MB in the end (delta: -5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:50:46,911 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 169.9MB. Free memory is still 77.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:50:46,912 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.58ms. Allocated memory is still 169.9MB. Free memory is still 133.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.21ms. Allocated memory is still 169.9MB. Free memory was 114.4MB in the beginning and 101.2MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.11ms. Allocated memory is still 169.9MB. Free memory was 101.2MB in the beginning and 97.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.92ms. Allocated memory is still 169.9MB. Free memory was 97.6MB in the beginning and 92.3MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 404.70ms. Allocated memory is still 169.9MB. Free memory was 92.3MB in the beginning and 72.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1171.58ms. Allocated memory is still 169.9MB. Free memory was 71.8MB in the beginning and 77.3MB in the end (delta: -5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 169.9MB. Free memory is still 77.3MB. 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 83, overapproximation of someBinaryArithmeticDOUBLEoperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 25; [L25] unsigned char var_1_4 = 4; [L26] double var_1_8 = 49.8; [L27] double var_1_9 = 127.8; [L28] double var_1_10 = 7.2; [L29] signed char var_1_11 = -1; [L30] signed char var_1_12 = 2; [L31] signed char var_1_13 = 4; [L32] signed char var_1_14 = 16; [L33] unsigned short int var_1_15 = 0; [L87] isInitial = 1 [L88] FCALL initially() [L89] COND TRUE 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L58] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=25, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L59] var_1_3 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] CALL assume_abort_if_not(var_1_3 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L61] RET assume_abort_if_not(var_1_3 <= 65534) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=4, var_1_8=249/5, var_1_9=639/5] [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=249/5, var_1_9=639/5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=249/5, var_1_9=639/5] [L64] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=249/5, var_1_9=639/5] [L64] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_8=249/5, var_1_9=639/5] [L65] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5, var_1_9=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5, var_1_9=639/5] [L65] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5, var_1_9=639/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=36/5, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-1, var_1_12=2, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L70] var_1_12 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L71] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L72] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L72] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=4, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L73] var_1_13 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L74] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L75] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L75] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=16, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L76] var_1_14 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L77] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L78] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L78] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L91] RET updateVariables() [L92] CALL step() [L37] var_1_11 = ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14)))) [L38] var_1_15 = var_1_14 [L39] signed long int stepLocal_0 = var_1_3 / var_1_4; VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=128, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L40] COND TRUE \read(var_1_2) [L41] var_1_1 = (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=255, var_1_8=249/5] [L49] COND TRUE var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11)) [L50] var_1_8 = (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=255] [L92] RET step() [L93] CALL, EXPR property() [L83-L84] return (((var_1_2 ? (var_1_1 == ((unsigned short int) (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) < 0 ) ? -((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) : ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) : (((var_1_3 / var_1_4) >= (((((var_1_15 * var_1_15)) < (var_1_11)) ? ((var_1_15 * var_1_15)) : (var_1_11)))) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) 5)))) && ((var_1_11 >= ((var_1_3 / var_1_4) + (var_1_1 * var_1_11))) ? (var_1_8 == ((double) (var_1_9 + ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))) : (var_1_8 == ((double) var_1_9)))) && (var_1_11 == ((signed char) ((var_1_12 + var_1_13) - ((((25) < (var_1_14)) ? (25) : (var_1_14))))))) && (var_1_15 == ((unsigned short int) var_1_14)) ; [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=255] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_1=1, var_1_2=1, var_1_3=1, var_1_4=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, 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, 51 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 51 mSDtfsCounter, 3 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=39occurred 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, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 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-14 11:50:46,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:50:48,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:50:49,038 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:50:49,042 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:50:49,043 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:50:49,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:50:49,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:50:49,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:50:49,068 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:50:49,069 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:50:49,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:50:49,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:50:49,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:50:49,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:50:49,070 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:50:49,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:50:49,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:50:49,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:50:49,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:50:49,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:50:49,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:50:49,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:50:49,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:50:49,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:50:49,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:50:49,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:50:49,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:50:49,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:50:49,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:50:49,078 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:50:49,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:50:49,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:50:49,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:50:49,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:50:49,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:50:49,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:50:49,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:50:49,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:50:49,079 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:50:49,079 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:50:49,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:50:49,080 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:50:49,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:50:49,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:50:49,081 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:50:49,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 39a407deab3a4246189c08648d528f65ba8317503440791fad31b3eeb9a40e8c [2024-10-14 11:50:49,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:50:49,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:50:49,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:50:49,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:50:49,386 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:50:49,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-10-14 11:50:50,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:50:51,008 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:50:51,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-83.i [2024-10-14 11:50:51,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ac9e161/63e09d16c68b49daa3ba26e820cec1da/FLAG873f7ee0d [2024-10-14 11:50:51,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ac9e161/63e09d16c68b49daa3ba26e820cec1da [2024-10-14 11:50:51,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:50:51,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:50:51,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:50:51,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:50:51,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:50:51,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d3b8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51, skipping insertion in model container [2024-10-14 11:50:51,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:50:51,216 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-83.i[915,928] [2024-10-14 11:50:51,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:50:51,278 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:50:51,288 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-83.i[915,928] [2024-10-14 11:50:51,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:50:51,332 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:50:51,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51 WrapperNode [2024-10-14 11:50:51,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:50:51,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:50:51,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:50:51,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:50:51,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,349 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,374 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-10-14 11:50:51,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:50:51,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:50:51,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:50:51,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:50:51,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,403 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-14 11:50:51,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:50:51,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:50:51,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:50:51,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:50:51,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (1/1) ... [2024-10-14 11:50:51,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:50:51,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:50:51,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:50:51,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:50:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:50:51,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:50:51,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:50:51,510 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:50:51,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:50:51,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:50:51,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:50:51,615 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:50:52,321 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 11:50:52,321 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:50:52,396 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:50:52,396 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:50:52,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:52 BoogieIcfgContainer [2024-10-14 11:50:52,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:50:52,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:50:52,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:50:52,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:50:52,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:50:51" (1/3) ... [2024-10-14 11:50:52,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff5c6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:52, skipping insertion in model container [2024-10-14 11:50:52,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:50:51" (2/3) ... [2024-10-14 11:50:52,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff5c6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:50:52, skipping insertion in model container [2024-10-14 11:50:52,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:50:52" (3/3) ... [2024-10-14 11:50:52,403 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-83.i [2024-10-14 11:50:52,416 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:50:52,416 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:50:52,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:50:52,471 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;@5c88bd98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:50:52,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:50:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 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-14 11:50:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 11:50:52,483 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:50:52,484 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] [2024-10-14 11:50:52,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:50:52,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:50:52,503 INFO L85 PathProgramCache]: Analyzing trace with hash 43849795, now seen corresponding path program 1 times [2024-10-14 11:50:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:50:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968282021] [2024-10-14 11:50:52,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:50:52,516 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-14 11:50:52,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:50:52,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:50:52,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:50:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:52,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:50:52,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:50:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-14 11:50:52,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:50:52,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:50:52,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968282021] [2024-10-14 11:50:52,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968282021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:50:52,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:50:52,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:50:52,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683111322] [2024-10-14 11:50:52,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:50:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:50:52,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:50:52,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:50:52,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:50:52,780 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 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) 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), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 11:50:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:50:52,943 INFO L93 Difference]: Finished difference Result 75 states and 131 transitions. [2024-10-14 11:50:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:50:52,958 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), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 90 [2024-10-14 11:50:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:50:52,963 INFO L225 Difference]: With dead ends: 75 [2024-10-14 11:50:52,964 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 11:50:52,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-14 11:50:52,969 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:50:52,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:50:52,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 11:50:53,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-14 11:50:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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-14 11:50:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2024-10-14 11:50:53,012 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 90 [2024-10-14 11:50:53,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:50:53,014 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2024-10-14 11:50:53,014 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), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 11:50:53,014 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2024-10-14 11:50:53,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 11:50:53,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:50:53,018 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] [2024-10-14 11:50:53,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 11:50:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:50:53,220 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:50:53,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:50:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash -756259331, now seen corresponding path program 1 times [2024-10-14 11:50:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:50:53,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340234980] [2024-10-14 11:50:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:50:53,222 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-14 11:50:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:50:53,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:50:53,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:50:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:50:53,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 11:50:53,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:51:24,629 WARN L286 SmtUtils]: Spent 14.58s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)