./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-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:33:07,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:33:07,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:33:07,155 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:33:07,155 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:33:07,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:33:07,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:33:07,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:33:07,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:33:07,181 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:33:07,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:33:07,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:33:07,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:33:07,182 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:33:07,182 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:33:07,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:33:07,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:33:07,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:33:07,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:33:07,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:33:07,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:33:07,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:33:07,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:33:07,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:33:07,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:33:07,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:33:07,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:33:07,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:33:07,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:33:07,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:33:07,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:33:07,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:33:07,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:33:07,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:33:07,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:33:07,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:33:07,188 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:33:07,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:33:07,189 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:33:07,189 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:33:07,189 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:33:07,189 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:33:07,189 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 [2024-10-11 11:33:07,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:33:07,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:33:07,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:33:07,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:33:07,420 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:33:07,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-11 11:33:08,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:33:08,823 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:33:08,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-11 11:33:08,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8853eefb4/0be37c1c6db24dcca4debf62ed6709ad/FLAGf72ba24ac [2024-10-11 11:33:08,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8853eefb4/0be37c1c6db24dcca4debf62ed6709ad [2024-10-11 11:33:08,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:33:08,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:33:08,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:33:08,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:33:08,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:33:08,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:33:08" (1/1) ... [2024-10-11 11:33:08,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d31519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:08, skipping insertion in model container [2024-10-11 11:33:08,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:33:08" (1/1) ... [2024-10-11 11:33:08,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:33:09,034 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-91.i[915,928] [2024-10-11 11:33:09,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:09,088 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:33:09,109 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-91.i[915,928] [2024-10-11 11:33:09,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:09,145 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:33:09,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09 WrapperNode [2024-10-11 11:33:09,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:33:09,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:09,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:33:09,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:33:09,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,180 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-11 11:33:09,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:09,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:33:09,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:33:09,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:33:09,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,201 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:33:09,201 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,201 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,209 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:33:09,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:33:09,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:33:09,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:33:09,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (1/1) ... [2024-10-11 11:33:09,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:33:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:33:09,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:33:09,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:33:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:33:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:33:09,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:33:09,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:33:09,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:33:09,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:33:09,329 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:33:09,330 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:33:09,533 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:33:09,533 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:33:09,555 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:33:09,555 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:33:09,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:09 BoogieIcfgContainer [2024-10-11 11:33:09,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:33:09,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:33:09,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:33:09,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:33:09,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:33:08" (1/3) ... [2024-10-11 11:33:09,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396076bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:09, skipping insertion in model container [2024-10-11 11:33:09,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:09" (2/3) ... [2024-10-11 11:33:09,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396076bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:09, skipping insertion in model container [2024-10-11 11:33:09,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:09" (3/3) ... [2024-10-11 11:33:09,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-11 11:33:09,576 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:33:09,576 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:33:09,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:33:09,630 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;@48493b33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:33:09,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:33:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:33:09,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 11:33:09,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:09,641 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:33:09,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:09,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash 58562802, now seen corresponding path program 1 times [2024-10-11 11:33:09,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:09,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187408825] [2024-10-11 11:33:09,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:09,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:09,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:33:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:09,887 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:33:09,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:09,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187408825] [2024-10-11 11:33:09,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187408825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:09,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:09,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:33:09,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971427046] [2024-10-11 11:33:09,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:09,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:33:09,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:09,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:33:09,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:33:09,916 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 11:33:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:09,951 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2024-10-11 11:33:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:33:09,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 71 [2024-10-11 11:33:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:09,960 INFO L225 Difference]: With dead ends: 97 [2024-10-11 11:33:09,960 INFO L226 Difference]: Without dead ends: 47 [2024-10-11 11:33:09,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:33:09,966 INFO L432 NwaCegarLoop]: 67 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, 67 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:09,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:33:09,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-11 11:33:09,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-11 11:33:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:33:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-11 11:33:10,010 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 71 [2024-10-11 11:33:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:10,010 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-11 11:33:10,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 11:33:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-11 11:33:10,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 11:33:10,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:10,018 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:33:10,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:33:10,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:10,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1651982900, now seen corresponding path program 1 times [2024-10-11 11:33:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:10,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217854903] [2024-10-11 11:33:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:10,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:33:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:10,856 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:33:10,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:10,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217854903] [2024-10-11 11:33:10,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217854903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:10,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:10,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:33:10,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962463925] [2024-10-11 11:33:10,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:10,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:33:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:10,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:33:10,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:33:10,860 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:33:15,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:33:19,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 11:33:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:20,178 INFO L93 Difference]: Finished difference Result 148 states and 216 transitions. [2024-10-11 11:33:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:33:20,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 71 [2024-10-11 11:33:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:20,180 INFO L225 Difference]: With dead ends: 148 [2024-10-11 11:33:20,180 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 11:33:20,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:33:20,184 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 87 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:20,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 254 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-10-11 11:33:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 11:33:20,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 50. [2024-10-11 11:33:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 37 states have internal predecessors, (52), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:33:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-11 11:33:20,199 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 71 [2024-10-11 11:33:20,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:20,200 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-11 11:33:20,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:33:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-11 11:33:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 11:33:20,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:20,204 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:33:20,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:33:20,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:20,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash -867977034, now seen corresponding path program 1 times [2024-10-11 11:33:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394481108] [2024-10-11 11:33:20,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:20,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:33:20,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940931978] [2024-10-11 11:33:20,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:33:20,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:33:20,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:33:20,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:33:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:33:20,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:33:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:33:20,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:33:20,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:33:20,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:33:20,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:33:20,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:33:20,591 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:33:20,648 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:33:20,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:33:20 BoogieIcfgContainer [2024-10-11 11:33:20,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:33:20,653 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:33:20,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:33:20,653 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:33:20,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:09" (3/4) ... [2024-10-11 11:33:20,655 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:33:20,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:33:20,656 INFO L158 Benchmark]: Toolchain (without parser) took 11810.69ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 80.4MB in the beginning and 149.9MB in the end (delta: -69.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:33:20,659 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:33:20,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.92ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 80.3MB in the beginning and 189.1MB in the end (delta: -108.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-10-11 11:33:20,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.06ms. Allocated memory is still 218.1MB. Free memory was 189.1MB in the beginning and 187.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:33:20,660 INFO L158 Benchmark]: Boogie Preprocessor took 30.06ms. Allocated memory is still 218.1MB. Free memory was 187.0MB in the beginning and 183.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:33:20,660 INFO L158 Benchmark]: RCFGBuilder took 344.00ms. Allocated memory is still 218.1MB. Free memory was 183.9MB in the beginning and 165.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:33:20,660 INFO L158 Benchmark]: TraceAbstraction took 11094.94ms. Allocated memory is still 218.1MB. Free memory was 164.0MB in the beginning and 149.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-11 11:33:20,660 INFO L158 Benchmark]: Witness Printer took 3.43ms. Allocated memory is still 218.1MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:33:20,661 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.14ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.92ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 80.3MB in the beginning and 189.1MB in the end (delta: -108.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.06ms. Allocated memory is still 218.1MB. Free memory was 189.1MB in the beginning and 187.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.06ms. Allocated memory is still 218.1MB. Free memory was 187.0MB in the beginning and 183.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.00ms. Allocated memory is still 218.1MB. Free memory was 183.9MB in the beginning and 165.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11094.94ms. Allocated memory is still 218.1MB. Free memory was 164.0MB in the beginning and 149.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Witness Printer took 3.43ms. Allocated memory is still 218.1MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000000; [L23] signed short int var_1_5 = 1; [L24] signed short int var_1_8 = -128; [L25] signed short int var_1_9 = 1; [L26] float var_1_10 = 25.8; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 1; [L29] float var_1_13 = 16.45; [L30] unsigned long int var_1_14 = 200; [L31] unsigned short int var_1_15 = 32; [L32] unsigned short int var_1_16 = 256; [L90] isInitial = 1 [L91] FCALL initially() [L92] int k_loop; [L93] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-128, var_1_9=1] [L93] COND TRUE k_loop < 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L65] var_1_8 = __VERIFIER_nondet_short() [L66] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L66] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L67] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=1] [L68] var_1_9 = __VERIFIER_nondet_short() [L69] CALL assume_abort_if_not(var_1_9 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L69] RET assume_abort_if_not(var_1_9 >= -32767) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L70] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L70] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L71] var_1_11 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L72] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L73] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L73] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=1, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L76] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L76] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_13=329/20, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L77] var_1_13 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L78] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=256, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L79] var_1_16 = __VERIFIER_nondet_ushort() [L80] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L80] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L81] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L81] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=200, var_1_15=32, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L95] RET updateVariables() [L96] CALL step() [L36] var_1_15 = var_1_16 [L37] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=129/5, var_1_11=0, var_1_12=0, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L38] COND FALSE !(\read(var_1_11)) [L49] var_1_10 = var_1_13 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L51] COND FALSE !(var_1_10 >= 50.4f) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=1, var_1_8=-32767, var_1_9=-32767] [L54] COND FALSE !(var_1_15 == (var_1_14 * var_1_15)) [L61] var_1_5 = var_1_8 VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] [L96] RET step() [L97] CALL, EXPR property() [L86] EXPR (((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] [L86-L87] return (((((var_1_10 >= 50.4f) ? (var_1_1 == ((unsigned long int) ((((var_1_15) > (var_1_15)) ? (var_1_15) : (var_1_15))))) : 1) && ((var_1_15 == (var_1_14 * var_1_15)) ? ((var_1_10 >= (var_1_10 + var_1_10)) ? (var_1_5 == ((signed short int) ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_5 == ((signed short int) var_1_8))) : (var_1_5 == ((signed short int) var_1_8)))) && (var_1_11 ? (var_1_12 ? (((var_1_15 & var_1_14) == var_1_15) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13))) : (var_1_10 == ((float) var_1_13)))) && (var_1_14 == ((unsigned long int) var_1_15))) && (var_1_15 == ((unsigned short int) var_1_16)) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=3, var_1_15=3, var_1_16=3, var_1_1=100000000, var_1_5=-32767, var_1_8=-32767, var_1_9=-32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.0s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 162 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 52 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 213 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 440/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:33:20,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:33:22,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:33:22,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:33:22,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:33:22,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:33:22,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:33:22,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:33:22,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:33:22,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:33:22,609 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:33:22,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:33:22,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:33:22,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:33:22,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:33:22,610 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:33:22,610 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:33:22,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:33:22,611 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:33:22,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:33:22,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:33:22,615 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:33:22,615 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:33:22,615 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:33:22,615 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:33:22,616 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:33:22,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:33:22,616 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:33:22,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:33:22,616 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:33:22,616 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:33:22,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:33:22,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:33:22,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:33:22,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:33:22,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:33:22,618 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:33:22,618 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:33:22,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:33:22,618 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:33:22,618 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:33:22,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:33:22,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:33:22,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:33:22,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:33:22,619 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:33:22,619 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 [2024-10-11 11:33:22,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:33:22,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:33:22,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:33:22,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:33:22,912 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:33:22,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-11 11:33:24,148 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:33:24,300 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:33:24,300 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-11 11:33:24,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c08932034/b91f94c0c7444cbe96eab85b5e34663d/FLAG3d981a054 [2024-10-11 11:33:24,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c08932034/b91f94c0c7444cbe96eab85b5e34663d [2024-10-11 11:33:24,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:33:24,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:33:24,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:33:24,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:33:24,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:33:24,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:24,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61862fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24, skipping insertion in model container [2024-10-11 11:33:24,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:24,722 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:33:24,876 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-91.i[915,928] [2024-10-11 11:33:24,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:24,931 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:33:24,941 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-91.i[915,928] [2024-10-11 11:33:24,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:33:24,998 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:33:24,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24 WrapperNode [2024-10-11 11:33:24,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:33:25,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:25,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:33:25,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:33:25,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,046 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-10-11 11:33:25,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:33:25,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:33:25,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:33:25,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:33:25,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,076 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:33:25,080 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,090 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:33:25,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:33:25,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:33:25,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:33:25,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (1/1) ... [2024-10-11 11:33:25,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:33:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:33:25,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:33:25,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:33:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:33:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:33:25,178 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:33:25,178 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:33:25,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:33:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:33:25,240 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:33:25,242 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:33:25,502 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-11 11:33:25,503 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:33:25,557 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:33:25,558 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:33:25,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:25 BoogieIcfgContainer [2024-10-11 11:33:25,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:33:25,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:33:25,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:33:25,564 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:33:25,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:33:24" (1/3) ... [2024-10-11 11:33:25,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6bfed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:25, skipping insertion in model container [2024-10-11 11:33:25,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:33:24" (2/3) ... [2024-10-11 11:33:25,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d6bfed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:33:25, skipping insertion in model container [2024-10-11 11:33:25,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:33:25" (3/3) ... [2024-10-11 11:33:25,567 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-11 11:33:25,579 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:33:25,579 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:33:25,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:33:25,644 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;@3f499309, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:33:25,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:33:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:33:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 11:33:25,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:25,658 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:33:25,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:25,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:25,663 INFO L85 PathProgramCache]: Analyzing trace with hash 824074980, now seen corresponding path program 1 times [2024-10-11 11:33:25,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:33:25,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181270814] [2024-10-11 11:33:25,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:25,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:33:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:33:25,679 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:33:25,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:33:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:25,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 11:33:25,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:33:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 11:33:27,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:33:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:33:48,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:33:48,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181270814] [2024-10-11 11:33:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181270814] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:33:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:33:48,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-10-11 11:33:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981680745] [2024-10-11 11:33:48,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:48,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:33:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:33:48,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:33:48,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:33:48,729 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:33:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:54,316 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-10-11 11:33:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:33:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 69 [2024-10-11 11:33:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:54,326 INFO L225 Difference]: With dead ends: 112 [2024-10-11 11:33:54,326 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 11:33:54,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 11:33:54,332 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:54,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 11:33:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 11:33:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-10-11 11:33:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 42 states have internal predecessors, (50), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 11:33:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-10-11 11:33:54,375 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 69 [2024-10-11 11:33:54,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:54,375 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-10-11 11:33:54,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 11:33:54,376 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2024-10-11 11:33:54,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 11:33:54,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:54,378 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:33:54,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:33:54,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:33:54,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:54,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:54,579 INFO L85 PathProgramCache]: Analyzing trace with hash 825922022, now seen corresponding path program 1 times [2024-10-11 11:33:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:33:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020086221] [2024-10-11 11:33:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:54,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:33:54,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:33:54,583 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:33:54,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:33:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:54,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 11:33:54,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:33:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 11:33:56,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:34:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-10-11 11:34:05,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:34:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020086221] [2024-10-11 11:34:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020086221] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:34:05,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:34:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-10-11 11:34:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621028129] [2024-10-11 11:34:05,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:34:05,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 11:34:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:34:05,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 11:34:05,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 11:34:05,414 INFO L87 Difference]: Start difference. First operand 66 states and 90 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-11 11:34:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:34:14,500 INFO L93 Difference]: Finished difference Result 209 states and 279 transitions. [2024-10-11 11:34:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 11:34:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 69 [2024-10-11 11:34:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:34:14,504 INFO L225 Difference]: With dead ends: 209 [2024-10-11 11:34:14,504 INFO L226 Difference]: Without dead ends: 144 [2024-10-11 11:34:14,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=349, Invalid=841, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 11:34:14,506 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 137 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:34:14,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 208 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-11 11:34:14,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-11 11:34:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 46. [2024-10-11 11:34:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 11:34:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-10-11 11:34:14,518 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 69 [2024-10-11 11:34:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:34:14,519 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-11 11:34:14,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-11 11:34:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2024-10-11 11:34:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 11:34:14,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:34:14,520 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:34:14,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:34:14,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:34:14,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:34:14,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:34:14,725 INFO L85 PathProgramCache]: Analyzing trace with hash -232664620, now seen corresponding path program 1 times [2024-10-11 11:34:14,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:34:14,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087096162] [2024-10-11 11:34:14,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:14,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:34:14,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:34:14,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:34:14,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:34:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:14,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 11:34:14,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:34:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 90 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-10-11 11:34:16,437 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:34:37,524 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 11:34:37,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:34:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087096162] [2024-10-11 11:34:37,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087096162] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 11:34:37,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:34:37,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-10-11 11:34:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721165601] [2024-10-11 11:34:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:34:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:34:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:34:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:34:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 11:34:37,527 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11)