./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:37:19,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:37:19,990 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:37:19,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:37:19,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:37:20,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:37:20,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:37:20,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:37:20,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:37:20,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:37:20,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:37:20,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:37:20,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:37:20,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:37:20,034 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:37:20,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:37:20,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:37:20,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:37:20,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:37:20,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:37:20,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:37:20,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:37:20,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:37:20,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:37:20,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:37:20,039 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:37:20,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:37:20,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:37:20,040 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:37:20,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:37:20,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:37:20,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:37:20,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:37:20,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:37:20,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:37:20,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:37:20,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:37:20,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:37:20,043 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:37:20,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:37:20,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:37:20,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:37:20,051 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2024-10-14 11:37:20,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:37:20,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:37:20,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:37:20,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:37:20,337 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:37:20,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-14 11:37:21,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:37:21,937 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:37:21,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-14 11:37:21,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940badee0/7f60e286e81e405282120e6815210307/FLAGc1f36cc83 [2024-10-14 11:37:22,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/940badee0/7f60e286e81e405282120e6815210307 [2024-10-14 11:37:22,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:37:22,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:37:22,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:37:22,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:37:22,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:37:22,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23993f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22, skipping insertion in model container [2024-10-14 11:37:22,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:37:22,494 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-10-14 11:37:22,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:37:22,546 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:37:22,559 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-10-14 11:37:22,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:37:22,593 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:37:22,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22 WrapperNode [2024-10-14 11:37:22,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:37:22,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:22,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:37:22,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:37:22,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,651 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-14 11:37:22,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:22,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:37:22,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:37:22,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:37:22,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,701 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:37:22,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,723 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:37:22,730 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:37:22,730 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:37:22,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:37:22,731 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (1/1) ... [2024-10-14 11:37:22,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:37:22,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:37:22,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:37:22,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:37:22,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:37:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:37:22,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:37:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:37:22,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:37:22,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:37:22,887 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:37:22,888 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:37:23,057 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 11:37:23,058 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:37:23,102 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:37:23,102 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:37:23,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:23 BoogieIcfgContainer [2024-10-14 11:37:23,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:37:23,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:37:23,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:37:23,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:37:23,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:37:22" (1/3) ... [2024-10-14 11:37:23,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa99ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:23, skipping insertion in model container [2024-10-14 11:37:23,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:22" (2/3) ... [2024-10-14 11:37:23,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa99ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:23, skipping insertion in model container [2024-10-14 11:37:23,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:23" (3/3) ... [2024-10-14 11:37:23,114 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-14 11:37:23,138 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:37:23,138 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:37:23,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:37:23,198 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;@6eda613a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:37:23,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:37:23,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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-14 11:37:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 11:37:23,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:23,212 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-14 11:37:23,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:23,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1346839555, now seen corresponding path program 1 times [2024-10-14 11:37:23,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:37:23,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148190181] [2024-10-14 11:37:23,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:23,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:37:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:37:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:37:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:37:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:37:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 11:37:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 11:37:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,503 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-14 11:37:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:37:23,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148190181] [2024-10-14 11:37:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148190181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:23,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:37:23,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334079230] [2024-10-14 11:37:23,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:23,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:37:23,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:37:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:37:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:37:23,550 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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-14 11:37:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:37:23,600 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2024-10-14 11:37:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:37:23,606 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-14 11:37:23,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:37:23,613 INFO L225 Difference]: With dead ends: 62 [2024-10-14 11:37:23,613 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 11:37:23,616 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-14 11:37:23,622 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:37:23,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:37:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 11:37:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 11:37:23,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-14 11:37:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-14 11:37:23,665 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 45 [2024-10-14 11:37:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:37:23,666 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-14 11:37:23,666 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-14 11:37:23,667 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-14 11:37:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 11:37:23,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:23,669 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-14 11:37:23,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:37:23,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:23,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:23,671 INFO L85 PathProgramCache]: Analyzing trace with hash -380037489, now seen corresponding path program 1 times [2024-10-14 11:37:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:37:23,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262094826] [2024-10-14 11:37:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:37:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:37:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:37:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:37:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:37:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 11:37:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 11:37:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:23,998 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-14 11:37:24,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:37:24,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262094826] [2024-10-14 11:37:24,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262094826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:24,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:24,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:37:24,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217134204] [2024-10-14 11:37:24,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:24,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:37:24,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:37:24,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:37:24,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:37:24,007 INFO L87 Difference]: Start difference. First operand 29 states and 38 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-14 11:37:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:37:24,046 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-10-14 11:37:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:37:24,047 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-14 11:37:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:37:24,048 INFO L225 Difference]: With dead ends: 57 [2024-10-14 11:37:24,049 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 11:37:24,050 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-14 11:37:24,052 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:37:24,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:37:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 11:37:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 11:37:24,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 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-14 11:37:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-14 11:37:24,062 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 45 [2024-10-14 11:37:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:37:24,065 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-14 11:37:24,065 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-14 11:37:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-14 11:37:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 11:37:24,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:24,068 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, 1] [2024-10-14 11:37:24,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:37:24,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:24,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1906004842, now seen corresponding path program 1 times [2024-10-14 11:37:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:37:24,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294488447] [2024-10-14 11:37:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:24,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:37:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:37:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:37:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:37:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:37:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 11:37:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 11:37:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,212 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-14 11:37:24,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:37:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294488447] [2024-10-14 11:37:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294488447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:24,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:24,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:37:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122104412] [2024-10-14 11:37:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:24,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:37:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:37:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:37:24,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:37:24,220 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-14 11:37:24,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:37:24,249 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-14 11:37:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:37:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 46 [2024-10-14 11:37:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:37:24,251 INFO L225 Difference]: With dead ends: 57 [2024-10-14 11:37:24,252 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 11:37:24,252 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-14 11:37:24,254 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:37:24,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:37:24,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 11:37:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 11:37:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 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-14 11:37:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-14 11:37:24,262 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 46 [2024-10-14 11:37:24,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:37:24,262 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-14 11:37:24,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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-14 11:37:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-14 11:37:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 11:37:24,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:24,263 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, 1] [2024-10-14 11:37:24,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:37:24,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:24,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:24,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1905945260, now seen corresponding path program 1 times [2024-10-14 11:37:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:37:24,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600524651] [2024-10-14 11:37:24,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:24,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:37:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:37:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 11:37:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 11:37:24,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 11:37:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 11:37:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 11:37:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:24,459 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-14 11:37:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:37:24,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600524651] [2024-10-14 11:37:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600524651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:24,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:24,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:37:24,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757022543] [2024-10-14 11:37:24,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:24,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:37:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:37:24,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:37:24,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:37:24,464 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 11:37:24,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:37:24,555 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2024-10-14 11:37:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:37:24,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 46 [2024-10-14 11:37:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:37:24,558 INFO L225 Difference]: With dead ends: 93 [2024-10-14 11:37:24,558 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 11:37:24,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:37:24,562 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:37:24,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:37:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 11:37:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2024-10-14 11:37:24,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 11:37:24,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-10-14 11:37:24,579 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 46 [2024-10-14 11:37:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:37:24,579 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-14 11:37:24,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 11:37:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-10-14 11:37:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 11:37:24,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:24,581 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, 1, 1] [2024-10-14 11:37:24,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:37:24,581 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:24,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1603953589, now seen corresponding path program 1 times [2024-10-14 11:37:24,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:37:24,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401759745] [2024-10-14 11:37:24,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:24,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:37:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:37:24,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:37:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:37:24,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:37:24,658 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:37:24,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:37:24,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:37:24,667 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 11:37:24,716 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:37:24,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:37:24 BoogieIcfgContainer [2024-10-14 11:37:24,723 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:37:24,724 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:37:24,724 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:37:24,724 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:37:24,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:23" (3/4) ... [2024-10-14 11:37:24,728 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:37:24,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:37:24,729 INFO L158 Benchmark]: Toolchain (without parser) took 2404.72ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 84.7MB in the end (delta: 41.6MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2024-10-14 11:37:24,730 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 182.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:37:24,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.96ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 112.9MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:37:24,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.19ms. Allocated memory is still 182.5MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:37:24,732 INFO L158 Benchmark]: Boogie Preprocessor took 72.91ms. Allocated memory is still 182.5MB. Free memory was 110.9MB in the beginning and 108.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 11:37:24,733 INFO L158 Benchmark]: RCFGBuilder took 374.41ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 92.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 11:37:24,733 INFO L158 Benchmark]: TraceAbstraction took 1616.71ms. Allocated memory is still 182.5MB. Free memory was 91.6MB in the beginning and 84.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-10-14 11:37:24,734 INFO L158 Benchmark]: Witness Printer took 5.25ms. Allocated memory is still 182.5MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:37:24,735 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.56ms. Allocated memory is still 182.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.96ms. Allocated memory is still 182.5MB. Free memory was 126.3MB in the beginning and 112.9MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.19ms. Allocated memory is still 182.5MB. Free memory was 112.9MB in the beginning and 110.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.91ms. Allocated memory is still 182.5MB. Free memory was 110.9MB in the beginning and 108.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 374.41ms. Allocated memory is still 182.5MB. Free memory was 108.3MB in the beginning and 92.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1616.71ms. Allocated memory is still 182.5MB. Free memory was 91.6MB in the beginning and 84.7MB in the end (delta: 6.8MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Witness Printer took 5.25ms. Allocated memory is still 182.5MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.6; [L23] double var_1_2 = 64.25; [L24] double var_1_3 = 31.2; [L25] signed long int var_1_4 = 1; [L26] float var_1_7 = 100.5; [L27] float var_1_9 = 50.2; [L28] float var_1_10 = 0.125; [L29] float var_1_11 = 9999999999999.8; [L30] float var_1_12 = 3.5; [L31] unsigned short int var_1_13 = 0; [L32] double last_1_var_1_1 = 9999.6; [L33] unsigned short int last_1_var_1_13 = 0; [L82] isInitial = 1 [L83] FCALL initially() [L84] int k_loop; [L85] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L85] COND TRUE k_loop < 1 [L86] CALL updateLastVariables() [L74] last_1_var_1_1 = var_1_1 [L75] last_1_var_1_13 = var_1_13 [L86] RET updateLastVariables() [L87] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && 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_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && 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_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L64] var_1_9 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L65] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L66] var_1_10 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L67] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L68] var_1_11 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L69] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L70] var_1_12 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L71] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L87] RET updateVariables() [L88] CALL step() [L37] COND TRUE (- last_1_var_1_13) >= last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L38] COND FALSE !(last_1_var_1_13 > last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L46] COND TRUE -4 < var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L47] COND TRUE var_1_11 <= (24.6f * var_1_9) [L48] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=1, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L51] var_1_1 = (var_1_2 - var_1_3) [L52] signed long int stepLocal_0 = var_1_13 + var_1_4; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_13=1, var_1_4=1, var_1_7=201/2] [L53] COND FALSE !(stepLocal_0 < var_1_4) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L88] RET step() [L89] CALL, EXPR property() [L78-L79] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && (((- last_1_var_1_13) >= last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? ((var_1_3 == last_1_var_1_1) ? (var_1_4 == ((signed long int) last_1_var_1_13)) : (var_1_4 == ((signed long int) last_1_var_1_13))) : 1) : 1)) && (((var_1_13 + var_1_4) < var_1_4) ? (var_1_7 == ((float) (((((var_1_3 - (var_1_9 + var_1_10))) < ((var_1_11 + var_1_12))) ? ((var_1_3 - (var_1_9 + var_1_10))) : ((var_1_11 + var_1_12)))))) : (var_1_7 == ((float) var_1_11)))) && ((-4 < var_1_4) ? ((var_1_11 <= (24.6f * var_1_9)) ? (var_1_13 == ((unsigned short int) var_1_4)) : 1) : 1) ; [L89] RET, EXPR property() [L89] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 129 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=4, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 11:37:24,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:37:26,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:37:27,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:37:27,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:37:27,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:37:27,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:37:27,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:37:27,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:37:27,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:37:27,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:37:27,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:37:27,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:37:27,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:37:27,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:37:27,092 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:37:27,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:37:27,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:37:27,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:37:27,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:37:27,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:37:27,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:37:27,098 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:37:27,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:37:27,098 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:37:27,098 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:37:27,099 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:37:27,099 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:37:27,099 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:37:27,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:37:27,099 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:37:27,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:37:27,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:37:27,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:37:27,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:37:27,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:37:27,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:37:27,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:37:27,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:37:27,104 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:37:27,104 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:37:27,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:37:27,105 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:37:27,105 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:37:27,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:37:27,105 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:37:27,106 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2024-10-14 11:37:27,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:37:27,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:37:27,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:37:27,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:37:27,481 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:37:27,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-14 11:37:29,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:37:29,227 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:37:29,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-14 11:37:29,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32cb0e768/7ff75759f5e04cda8f6f703d2eea0eea/FLAGdbc0166ca [2024-10-14 11:37:29,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32cb0e768/7ff75759f5e04cda8f6f703d2eea0eea [2024-10-14 11:37:29,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:37:29,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:37:29,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:37:29,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:37:29,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:37:29,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:29,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f65909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29, skipping insertion in model container [2024-10-14 11:37:29,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:29,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:37:29,797 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-10-14 11:37:29,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:37:29,878 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:37:29,897 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i[915,928] [2024-10-14 11:37:29,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:37:29,946 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:37:29,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29 WrapperNode [2024-10-14 11:37:29,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:37:29,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:29,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:37:29,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:37:29,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:29,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:29,995 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-14 11:37:29,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:37:29,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:37:29,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:37:29,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:37:30,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,039 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 11:37:30,040 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,040 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,051 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,060 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:37:30,072 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:37:30,072 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:37:30,072 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:37:30,073 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (1/1) ... [2024-10-14 11:37:30,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:37:30,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:37:30,104 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 11:37:30,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 11:37:30,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:37:30,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 11:37:30,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:37:30,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:37:30,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:37:30,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:37:30,226 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:37:30,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:37:37,100 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-14 11:37:37,101 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:37:37,144 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:37:37,144 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:37:37,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:37 BoogieIcfgContainer [2024-10-14 11:37:37,145 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:37:37,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:37:37,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:37:37,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:37:37,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:37:29" (1/3) ... [2024-10-14 11:37:37,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209a3d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:37, skipping insertion in model container [2024-10-14 11:37:37,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:37:29" (2/3) ... [2024-10-14 11:37:37,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209a3d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:37:37, skipping insertion in model container [2024-10-14 11:37:37,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:37:37" (3/3) ... [2024-10-14 11:37:37,157 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-14 11:37:37,176 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:37:37,177 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:37:37,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:37:37,254 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;@4a3e804f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:37:37,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:37:37,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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-14 11:37:37,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 11:37:37,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:37,273 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-14 11:37:37,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:37,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:37,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1346839555, now seen corresponding path program 1 times [2024-10-14 11:37:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:37:37,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971660296] [2024-10-14 11:37:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:37,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:37:37,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:37:37,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:37:37,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 11:37:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:37,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 11:37:37,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:37:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 11:37:37,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:37:37,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:37:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971660296] [2024-10-14 11:37:37,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971660296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:37,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:37,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:37:37,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858118274] [2024-10-14 11:37:37,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:37,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 11:37:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:37:37,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 11:37:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 11:37:37,714 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 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-14 11:37:41,899 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-14 11:37:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:37:41,941 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2024-10-14 11:37:41,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 11:37:41,943 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-14 11:37:41,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:37:41,957 INFO L225 Difference]: With dead ends: 62 [2024-10-14 11:37:41,957 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 11:37:41,960 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-14 11:37:41,963 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:37:41,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 11:37:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 11:37:41,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-14 11:37:41,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-14 11:37:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-14 11:37:41,993 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 45 [2024-10-14 11:37:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:37:41,994 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-14 11:37:41,994 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-14 11:37:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-14 11:37:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-14 11:37:41,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:37:41,996 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-14 11:37:42,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 11:37:42,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:37:42,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:37:42,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:37:42,199 INFO L85 PathProgramCache]: Analyzing trace with hash -380037489, now seen corresponding path program 1 times [2024-10-14 11:37:42,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:37:42,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126728684] [2024-10-14 11:37:42,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:37:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:37:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:37:42,203 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:37:42,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 11:37:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:37:42,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 11:37:42,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:37:43,034 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-14 11:37:43,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:37:43,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:37:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126728684] [2024-10-14 11:37:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126728684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:37:43,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:37:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:37:43,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645159109] [2024-10-14 11:37:43,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:37:43,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:37:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:37:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:37:43,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:37:43,042 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.5) 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-14 11:37:47,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:37:51,552 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-14 11:37:55,557 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-14 11:37:59,736 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-14 11:38:03,740 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-14 11:38:07,742 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-14 11:38:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:38:07,783 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2024-10-14 11:38:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:38:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) 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-14 11:38:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:38:07,787 INFO L225 Difference]: With dead ends: 95 [2024-10-14 11:38:07,787 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 11:38:07,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:38:07,788 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 14 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-10-14 11:38:07,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 96 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 24.7s Time] [2024-10-14 11:38:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 11:38:07,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2024-10-14 11:38:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 11:38:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-10-14 11:38:07,811 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 45 [2024-10-14 11:38:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:38:07,811 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-10-14 11:38:07,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) 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-14 11:38:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-10-14 11:38:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-14 11:38:07,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:38:07,813 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, 1] [2024-10-14 11:38:07,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:38:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:38:08,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:38:08,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:38:08,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1985008824, now seen corresponding path program 1 times [2024-10-14 11:38:08,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:38:08,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484399841] [2024-10-14 11:38:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:38:08,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:38:08,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:38:08,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:38:08,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 11:38:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:08,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 11:38:08,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:38:08,850 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-14 11:38:08,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:38:08,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:38:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484399841] [2024-10-14 11:38:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484399841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:38:08,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:38:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 11:38:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254371697] [2024-10-14 11:38:08,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:38:08,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:38:08,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:38:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:38:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:38:08,854 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-14 11:38:13,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:38:17,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:38:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:38:17,457 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2024-10-14 11:38:17,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:38:17,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 46 [2024-10-14 11:38:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:38:17,460 INFO L225 Difference]: With dead ends: 109 [2024-10-14 11:38:17,460 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 11:38:17,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:38:17,461 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-10-14 11:38:17,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2024-10-14 11:38:17,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 11:38:17,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 11:38:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 11:38:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2024-10-14 11:38:17,473 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 46 [2024-10-14 11:38:17,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:38:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2024-10-14 11:38:17,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-14 11:38:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2024-10-14 11:38:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 11:38:17,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:38:17,475 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, 1, 1] [2024-10-14 11:38:17,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 11:38:17,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:38:17,676 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:38:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:38:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1604013171, now seen corresponding path program 1 times [2024-10-14 11:38:17,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:38:17,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067658292] [2024-10-14 11:38:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:38:17,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:38:17,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:38:17,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:38:17,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 11:38:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:18,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 11:38:18,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:38:18,649 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-14 11:38:18,649 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 11:38:18,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 11:38:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067658292] [2024-10-14 11:38:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067658292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:38:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:38:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:38:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294751406] [2024-10-14 11:38:18,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:38:18,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:38:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 11:38:18,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:38:18,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:38:18,656 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-14 11:38:22,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:38:26,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:38:30,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 11:38:30,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:38:30,700 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2024-10-14 11:38:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:38:30,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 47 [2024-10-14 11:38:30,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:38:30,707 INFO L225 Difference]: With dead ends: 85 [2024-10-14 11:38:30,707 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 11:38:30,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 11:38:30,709 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 50 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:38:30,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 93 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 12.0s Time] [2024-10-14 11:38:30,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 11:38:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-14 11:38:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 11:38:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2024-10-14 11:38:30,720 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 47 [2024-10-14 11:38:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:38:30,721 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2024-10-14 11:38:30,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-14 11:38:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2024-10-14 11:38:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 11:38:30,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:38:30,722 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, 1, 1] [2024-10-14 11:38:30,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 11:38:30,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:38:30,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:38:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:38:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1603953589, now seen corresponding path program 1 times [2024-10-14 11:38:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 11:38:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336572774] [2024-10-14 11:38:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:38:30,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 11:38:30,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 11:38:30,929 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 11:38:30,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 11:38:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:38:31,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 11:38:31,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:38:56,844 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)