./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-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.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 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:35:33,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:35:33,092 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:35:33,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:35:33,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:35:33,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:35:33,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:35:33,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:35:33,114 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:35:33,114 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:35:33,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:35:33,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:35:33,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:35:33,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:35:33,115 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:35:33,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:35:33,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:35:33,116 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:35:33,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:35:33,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:35:33,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:35:33,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:35:33,121 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:35:33,121 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:35:33,121 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:35:33,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:35:33,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:35:33,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:35:33,122 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:35:33,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:35:33,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:35:33,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:35:33,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:35:33,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:35:33,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:35:33,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:35:33,123 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:35:33,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:35:33,123 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:35:33,124 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:35:33,124 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:35:33,125 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:35:33,125 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 -> 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d [2024-10-11 11:35:33,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:35:33,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:35:33,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:35:33,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:35:33,378 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:35:33,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i [2024-10-11 11:35:34,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:35:34,734 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:35:34,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i [2024-10-11 11:35:34,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54364532b/2b08ccc0bce541db99cde83ca47f2d1e/FLAG22738d585 [2024-10-11 11:35:34,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/54364532b/2b08ccc0bce541db99cde83ca47f2d1e [2024-10-11 11:35:34,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:35:34,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:35:34,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:35:34,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:35:34,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:35:34,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:34" (1/1) ... [2024-10-11 11:35:34,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a922dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:34, skipping insertion in model container [2024-10-11 11:35:34,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:34" (1/1) ... [2024-10-11 11:35:34,792 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:35:34,916 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-20.i[915,928] [2024-10-11 11:35:34,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:35:34,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:35:34,975 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-20.i[915,928] [2024-10-11 11:35:34,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:35:35,001 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:35:35,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35 WrapperNode [2024-10-11 11:35:35,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:35:35,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:35:35,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:35:35,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:35:35,009 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:35:35" (1/1) ... [2024-10-11 11:35:35,018 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:35:35" (1/1) ... [2024-10-11 11:35:35,036 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-10-11 11:35:35,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:35:35,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:35:35,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:35:35,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:35:35,049 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,062 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:35:35,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,066 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:35:35,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:35:35,075 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:35:35,075 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:35:35,076 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (1/1) ... [2024-10-11 11:35:35,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:35:35,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:35:35,108 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:35:35,110 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:35:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:35:35,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:35:35,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:35:35,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:35:35,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:35:35,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:35:35,193 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:35:35,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:35:35,347 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 11:35:35,347 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:35:35,374 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:35:35,375 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:35:35,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:35 BoogieIcfgContainer [2024-10-11 11:35:35,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:35:35,376 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:35:35,377 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:35:35,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:35:35,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:35:34" (1/3) ... [2024-10-11 11:35:35,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8e208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:35, skipping insertion in model container [2024-10-11 11:35:35,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:35" (2/3) ... [2024-10-11 11:35:35,381 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8e208e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:35, skipping insertion in model container [2024-10-11 11:35:35,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:35" (3/3) ... [2024-10-11 11:35:35,382 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-20.i [2024-10-11 11:35:35,395 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:35:35,395 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:35:35,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:35:35,457 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;@49a0d520, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:35:35,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:35:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:35:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 11:35:35,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:35,471 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:35:35,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:35,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1052916261, now seen corresponding path program 1 times [2024-10-11 11:35:35,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:35,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300789547] [2024-10-11 11:35:35,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:35,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:35:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:35:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:35:35,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:35:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:35,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300789547] [2024-10-11 11:35:35,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300789547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:35,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:35,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:35:35,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392228298] [2024-10-11 11:35:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:35,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:35:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:35,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:35:35,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:35:35,686 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:35:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:35,717 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-10-11 11:35:35,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:35:35,720 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-10-11 11:35:35,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:35,725 INFO L225 Difference]: With dead ends: 57 [2024-10-11 11:35:35,725 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 11:35:35,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:35:35,733 INFO L432 NwaCegarLoop]: 36 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, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:35,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:35:35,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 11:35:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 11:35:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:35:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-10-11 11:35:35,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 45 [2024-10-11 11:35:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:35,764 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-10-11 11:35:35,764 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, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:35:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2024-10-11 11:35:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 11:35:35,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:35,767 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:35:35,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:35:35,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:35,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash -765164323, now seen corresponding path program 1 times [2024-10-11 11:35:35,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:35,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380447372] [2024-10-11 11:35:35,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:35,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:35:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:35:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:35:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:35:35,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:35,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380447372] [2024-10-11 11:35:35,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380447372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:35,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:35,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:35:35,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473030485] [2024-10-11 11:35:35,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:35,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:35:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:35,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:35:35,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:35:35,904 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:35:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:35,938 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2024-10-11 11:35:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:35:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-10-11 11:35:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:35,941 INFO L225 Difference]: With dead ends: 64 [2024-10-11 11:35:35,942 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 11:35:35,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:35:35,943 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:35,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:35:35,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 11:35:35,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2024-10-11 11:35:35,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:35:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2024-10-11 11:35:35,952 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 45 [2024-10-11 11:35:35,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:35,952 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2024-10-11 11:35:35,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:35:35,953 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2024-10-11 11:35:35,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 11:35:35,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:35,954 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:35:35,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:35:35,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:35,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1009843039, now seen corresponding path program 1 times [2024-10-11 11:35:35,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:35,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820321098] [2024-10-11 11:35:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:35:36,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:35:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:35:36,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:35:36,057 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:35:36,059 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:35:36,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:35:36,065 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:35:36,095 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:35:36,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:35:36 BoogieIcfgContainer [2024-10-11 11:35:36,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:35:36,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:35:36,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:35:36,098 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:35:36,098 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:35" (3/4) ... [2024-10-11 11:35:36,100 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:35:36,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:35:36,101 INFO L158 Benchmark]: Toolchain (without parser) took 1346.85ms. Allocated memory is still 157.3MB. Free memory was 124.2MB in the beginning and 69.8MB in the end (delta: 54.4MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-11 11:35:36,101 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 157.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:35:36,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.24ms. Allocated memory is still 157.3MB. Free memory was 124.2MB in the beginning and 110.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:35:36,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.98ms. Allocated memory is still 157.3MB. Free memory was 110.9MB in the beginning and 108.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:35:36,102 INFO L158 Benchmark]: Boogie Preprocessor took 34.64ms. Allocated memory is still 157.3MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:35:36,102 INFO L158 Benchmark]: RCFGBuilder took 299.86ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 122.3MB in the end (delta: -15.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 11:35:36,102 INFO L158 Benchmark]: TraceAbstraction took 720.81ms. Allocated memory is still 157.3MB. Free memory was 121.4MB in the beginning and 69.8MB in the end (delta: 51.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-11 11:35:36,102 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 157.3MB. Free memory is still 69.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:35:36,104 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.15ms. Allocated memory is still 157.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.24ms. Allocated memory is still 157.3MB. Free memory was 124.2MB in the beginning and 110.9MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.98ms. Allocated memory is still 157.3MB. Free memory was 110.9MB in the beginning and 108.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.64ms. Allocated memory is still 157.3MB. Free memory was 108.9MB in the beginning and 106.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 299.86ms. Allocated memory is still 157.3MB. Free memory was 106.8MB in the beginning and 122.3MB in the end (delta: -15.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 720.81ms. Allocated memory is still 157.3MB. Free memory was 121.4MB in the beginning and 69.8MB in the end (delta: 51.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 157.3MB. Free memory is still 69.8MB. 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 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 [L82] RET updateLastVariables() [L83] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L83] RET updateVariables() [L84] CALL step() [L35] COND FALSE !(\read(var_1_2)) [L38] var_1_1 = (var_1_4 + var_1_6) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=0, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=0, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L43] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=0, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L50] COND TRUE var_1_7 <= var_1_5 [L51] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=0, var_1_6=1000000000004, var_1_7=51/5, var_1_8=1000000000004, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=0, var_1_6=1000000000004, var_1_7=51/5, var_1_8=1000000000004, var_1_9=1000000000004] [L84] RET step() [L85] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=0, var_1_6=1000000000004, var_1_7=51/5, var_1_8=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=0, var_1_6=1000000000004, var_1_7=51/5, var_1_8=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 97 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 70 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 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:35:36,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.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 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:35:37,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:35:37,921 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:35:37,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:35:37,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:35:37,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:35:37,953 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:35:37,953 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:35:37,954 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:35:37,954 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:35:37,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:35:37,955 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:35:37,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:35:37,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:35:37,957 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:35:37,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:35:37,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:35:37,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:35:37,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:35:37,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:35:37,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:35:37,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:35:37,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:35:37,960 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:35:37,961 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:35:37,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:35:37,961 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:35:37,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:35:37,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:35:37,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:35:37,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:35:37,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:35:37,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:35:37,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:35:37,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:35:37,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:35:37,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:35:37,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:35:37,964 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:35:37,964 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:35:37,964 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:35:37,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:35:37,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:35:37,965 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:35:37,965 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:35:37,965 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 -> 2ce1ea73380d9456a1f136ae7fb40364a65fd1608042e66fc50d954be964842d [2024-10-11 11:35:38,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:35:38,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:35:38,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:35:38,233 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:35:38,235 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:35:38,237 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i [2024-10-11 11:35:39,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:35:39,657 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:35:39,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-20.i [2024-10-11 11:35:39,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83075bb41/6876ea8569d9425fb61097936682b88d/FLAG141272bd8 [2024-10-11 11:35:39,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/83075bb41/6876ea8569d9425fb61097936682b88d [2024-10-11 11:35:39,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:35:39,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:35:39,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:35:39,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:35:39,691 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:35:39,692 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:39,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ea68f2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39, skipping insertion in model container [2024-10-11 11:35:39,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:39,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:35:39,861 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-20.i[915,928] [2024-10-11 11:35:39,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:35:39,919 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:35:39,930 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-20.i[915,928] [2024-10-11 11:35:39,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:35:39,964 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:35:39,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39 WrapperNode [2024-10-11 11:35:39,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:35:39,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:35:39,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:35:39,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:35:39,972 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:35:39" (1/1) ... [2024-10-11 11:35:39,982 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:35:39" (1/1) ... [2024-10-11 11:35:40,003 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 79 [2024-10-11 11:35:40,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:35:40,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:35:40,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:35:40,007 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:35:40,015 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,022 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,032 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:35:40,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:35:40,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:35:40,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:35:40,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:35:40,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (1/1) ... [2024-10-11 11:35:40,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:35:40,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:35:40,086 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:35:40,088 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:35:40,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:35:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:35:40,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:35:40,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:35:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:35:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:35:40,186 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:35:40,187 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:35:46,902 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 11:35:46,902 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:35:46,926 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:35:46,927 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:35:46,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:46 BoogieIcfgContainer [2024-10-11 11:35:46,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:35:46,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:35:46,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:35:46,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:35:46,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:35:39" (1/3) ... [2024-10-11 11:35:46,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46691f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:46, skipping insertion in model container [2024-10-11 11:35:46,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:35:39" (2/3) ... [2024-10-11 11:35:46,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46691f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:35:46, skipping insertion in model container [2024-10-11 11:35:46,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:35:46" (3/3) ... [2024-10-11 11:35:46,936 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-20.i [2024-10-11 11:35:46,948 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:35:46,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:35:47,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:35:47,010 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;@26d9e7da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:35:47,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:35:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:35:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 11:35:47,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:47,021 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:35:47,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:47,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1052916261, now seen corresponding path program 1 times [2024-10-11 11:35:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:35:47,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9392504] [2024-10-11 11:35:47,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:47,040 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:35:47,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:35:47,043 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:35:47,044 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:35:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:47,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:35:47,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:35:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 11:35:47,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:35:47,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:35:47,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9392504] [2024-10-11 11:35:47,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9392504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:47,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:47,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:35:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996396433] [2024-10-11 11:35:47,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:47,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:35:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:35:47,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:35:47,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:35:47,446 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:35:51,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:35:51,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:51,603 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-10-11 11:35:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:35:51,652 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-10-11 11:35:51,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:51,657 INFO L225 Difference]: With dead ends: 57 [2024-10-11 11:35:51,657 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 11:35:51,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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:35:51,662 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:51,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 11:35:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 11:35:51,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-11 11:35:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:35:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2024-10-11 11:35:51,706 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 45 [2024-10-11 11:35:51,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:51,706 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2024-10-11 11:35:51,707 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 11:35:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2024-10-11 11:35:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 11:35:51,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:51,708 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:35:51,722 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:35:51,909 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:35:51,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:51,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:51,911 INFO L85 PathProgramCache]: Analyzing trace with hash -765164323, now seen corresponding path program 1 times [2024-10-11 11:35:51,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:35:51,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059705666] [2024-10-11 11:35:51,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:51,911 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:35:51,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:35:51,914 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:35:51,916 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:35:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:52,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:35:52,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:35:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 11:35:52,325 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:35:52,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:35:52,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059705666] [2024-10-11 11:35:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059705666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:52,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:52,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:35:52,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633219555] [2024-10-11 11:35:52,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:52,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:35:52,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:35:52,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:35:52,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:35:52,330 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:35:53,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:35:58,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:36:02,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:36:06,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:36:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:36:06,099 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2024-10-11 11:36:06,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:36:06,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-10-11 11:36:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:36:06,149 INFO L225 Difference]: With dead ends: 64 [2024-10-11 11:36:06,149 INFO L226 Difference]: Without dead ends: 37 [2024-10-11 11:36:06,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:36:06,150 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:36:06,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 3 Unknown, 0 Unchecked, 13.8s Time] [2024-10-11 11:36:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-11 11:36:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2024-10-11 11:36:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 11:36:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2024-10-11 11:36:06,156 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 45 [2024-10-11 11:36:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:36:06,157 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2024-10-11 11:36:06,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 11:36:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2024-10-11 11:36:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 11:36:06,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:36:06,158 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:36:06,175 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 (3)] Ended with exit code 0 [2024-10-11 11:36:06,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:36:06,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:36:06,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:36:06,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1009843039, now seen corresponding path program 1 times [2024-10-11 11:36:06,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:36:06,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294440656] [2024-10-11 11:36:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:36:06,360 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:36:06,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:36:06,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:36:06,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:36:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:36:06,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 11:36:06,725 INFO L278 TraceCheckSpWp]: Computing forward predicates...