./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 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:32:28,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:32:28,134 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:32:28,137 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:32:28,137 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:32:28,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:32:28,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:32:28,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:32:28,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:32:28,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:32:28,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:32:28,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:32:28,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:32:28,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:32:28,167 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:32:28,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:32:28,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:32:28,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:32:28,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:32:28,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:32:28,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:32:28,173 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:32:28,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:32:28,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:32:28,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:32:28,173 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:32:28,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:32:28,174 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:32:28,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:32:28,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:32:28,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:32:28,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:32:28,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:28,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:32:28,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:32:28,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:32:28,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:32:28,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:32:28,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:32:28,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:32:28,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:32:28,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:32:28,177 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 [2024-10-24 09:32:28,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:32:28,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:32:28,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:32:28,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:32:28,435 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:32:28,436 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-24 09:32:29,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:32:29,892 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:32:29,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-24 09:32:29,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d571d1b0/f255f3b7e4554471bad9112b535586e8/FLAG5ad39f922 [2024-10-24 09:32:30,283 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d571d1b0/f255f3b7e4554471bad9112b535586e8 [2024-10-24 09:32:30,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:32:30,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:32:30,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:30,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:32:30,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:32:30,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e2758d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30, skipping insertion in model container [2024-10-24 09:32:30,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:32:30,451 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-24 09:32:30,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:30,486 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:32:30,496 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-24 09:32:30,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:30,531 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:32:30,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30 WrapperNode [2024-10-24 09:32:30,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:30,532 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:30,532 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:32:30,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:32:30,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,566 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-10-24 09:32:30,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:30,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:32:30,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:32:30,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:32:30,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,620 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-24 09:32:30,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,627 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:32:30,687 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:32:30,687 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:32:30,687 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:32:30,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (1/1) ... [2024-10-24 09:32:30,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:30,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:32:30,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:32:30,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:32:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:32:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:32:30,759 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:32:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:32:30,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:32:30,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:32:30,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:32:30,825 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:32:31,084 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 09:32:31,084 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:32:31,110 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:32:31,110 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:32:31,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:31 BoogieIcfgContainer [2024-10-24 09:32:31,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:32:31,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:32:31,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:32:31,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:32:31,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:32:30" (1/3) ... [2024-10-24 09:32:31,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467df044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:31, skipping insertion in model container [2024-10-24 09:32:31,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:30" (2/3) ... [2024-10-24 09:32:31,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467df044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:31, skipping insertion in model container [2024-10-24 09:32:31,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:31" (3/3) ... [2024-10-24 09:32:31,120 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-24 09:32:31,134 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:32:31,135 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:32:31,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:32:31,190 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;@75372b55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:32:31,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:32:31,193 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-24 09:32:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 09:32:31,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:31,200 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-24 09:32:31,201 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:31,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:31,204 INFO L85 PathProgramCache]: Analyzing trace with hash 58562802, now seen corresponding path program 1 times [2024-10-24 09:32:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:32:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336750877] [2024-10-24 09:32:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:32:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:32:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:32:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:32:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:32:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:32:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:32:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:32:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:32:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:32:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:32:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:32:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:31,431 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-24 09:32:31,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:32:31,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336750877] [2024-10-24 09:32:31,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336750877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:32:31,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:32:31,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:32:31,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158930996] [2024-10-24 09:32:31,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:32:31,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:32:31,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:32:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:32:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:32:31,461 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-24 09:32:31,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:32:31,488 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2024-10-24 09:32:31,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:32:31,490 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-24 09:32:31,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:32:31,499 INFO L225 Difference]: With dead ends: 97 [2024-10-24 09:32:31,500 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 09:32:31,504 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-24 09:32:31,507 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-24 09:32:31,508 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-24 09:32:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 09:32:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 09:32:31,541 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-24 09:32:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-24 09:32:31,544 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 71 [2024-10-24 09:32:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:32:31,544 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-24 09:32:31,545 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-24 09:32:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-24 09:32:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 09:32:31,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:31,547 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-24 09:32:31,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:32:31,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:31,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1651982900, now seen corresponding path program 1 times [2024-10-24 09:32:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:32:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037949758] [2024-10-24 09:32:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:32:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:32:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:32:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:32:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:32:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:32:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 09:32:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:32:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 09:32:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:32:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:32:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:32:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:32,653 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-24 09:32:32,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:32:32,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037949758] [2024-10-24 09:32:32,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037949758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:32:32,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:32:32,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:32:32,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026283809] [2024-10-24 09:32:32,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:32:32,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:32:32,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:32:32,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:32:32,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:32:32,659 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-24 09:32:37,482 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-24 09:32:41,486 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-24 09:32:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:32:42,034 INFO L93 Difference]: Finished difference Result 148 states and 216 transitions. [2024-10-24 09:32:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:32:42,034 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-24 09:32:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:32:42,036 INFO L225 Difference]: With dead ends: 148 [2024-10-24 09:32:42,036 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 09:32:42,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:32:42,037 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 87 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:32:42,038 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.1s Time] [2024-10-24 09:32:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 09:32:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 50. [2024-10-24 09:32:42,045 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-24 09:32:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-24 09:32:42,047 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 71 [2024-10-24 09:32:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:32:42,048 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-24 09:32:42,048 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-24 09:32:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-24 09:32:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-24 09:32:42,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:42,050 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-24 09:32:42,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:32:42,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:42,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -867977034, now seen corresponding path program 1 times [2024-10-24 09:32:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:32:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728260297] [2024-10-24 09:32:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:32:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:32:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681158563] [2024-10-24 09:32:42,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:32:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:32:42,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 09:32:42,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 09:32:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:32:42,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:32:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:32:42,212 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:32:42,212 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:32:42,213 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:32:42,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:32:42,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:32:42,418 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 09:32:42,463 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:32:42,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:32:42 BoogieIcfgContainer [2024-10-24 09:32:42,466 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:32:42,467 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:32:42,467 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:32:42,467 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:32:42,467 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:31" (3/4) ... [2024-10-24 09:32:42,468 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:32:42,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:32:42,470 INFO L158 Benchmark]: Toolchain (without parser) took 12183.31ms. Allocated memory is still 176.2MB. Free memory was 108.5MB in the beginning and 60.7MB in the end (delta: 47.8MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-10-24 09:32:42,470 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory was 133.9MB in the beginning and 133.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:32:42,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.73ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 94.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:32:42,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.72ms. Allocated memory is still 176.2MB. Free memory was 94.6MB in the beginning and 92.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:32:42,471 INFO L158 Benchmark]: Boogie Preprocessor took 118.54ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 147.4MB in the end (delta: -55.2MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-10-24 09:32:42,472 INFO L158 Benchmark]: RCFGBuilder took 424.41ms. Allocated memory is still 176.2MB. Free memory was 147.4MB in the beginning and 127.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:32:42,472 INFO L158 Benchmark]: TraceAbstraction took 11353.42ms. Allocated memory is still 176.2MB. Free memory was 127.1MB in the beginning and 61.8MB in the end (delta: 65.4MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. [2024-10-24 09:32:42,472 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 176.2MB. Free memory was 61.8MB in the beginning and 60.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:32:42,474 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 176.2MB. Free memory was 133.9MB in the beginning and 133.7MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.73ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 94.6MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.72ms. Allocated memory is still 176.2MB. Free memory was 94.6MB in the beginning and 92.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.54ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 147.4MB in the end (delta: -55.2MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * RCFGBuilder took 424.41ms. Allocated memory is still 176.2MB. Free memory was 147.4MB in the beginning and 127.8MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 11353.42ms. Allocated memory is still 176.2MB. Free memory was 127.1MB in the beginning and 61.8MB in the end (delta: 65.4MB). Peak memory consumption was 67.8MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 176.2MB. Free memory was 61.8MB in the beginning and 60.7MB in the end (delta: 1.0MB). 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.2s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 9.1s 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.4s 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.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 180 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-24 09:32:42,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:32:44,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:32:44,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:32:44,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:32:44,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:32:44,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:32:44,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:32:44,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:32:44,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:32:44,750 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:32:44,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:32:44,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:32:44,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:32:44,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:32:44,753 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:32:44,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:32:44,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:32:44,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:32:44,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:32:44,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:32:44,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:32:44,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:32:44,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:32:44,758 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:32:44,758 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:32:44,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:32:44,758 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:32:44,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:32:44,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:32:44,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:32:44,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:32:44,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:32:44,759 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:32:44,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:32:44,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:44,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:32:44,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:32:44,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:32:44,760 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:32:44,760 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:32:44,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:32:44,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:32:44,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:32:44,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:32:44,763 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:32:44,763 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fcc09d49231b686aa277ecab6a7e97333755471ed05bf82f2888dada5ad54255 [2024-10-24 09:32:45,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:32:45,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:32:45,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:32:45,057 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:32:45,058 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:32:45,059 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-24 09:32:46,398 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:32:46,575 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:32:46,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-24 09:32:46,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137007c5e/2b7f515e1e0a4585b611a15f44c2555c/FLAGe58cdfec9 [2024-10-24 09:32:46,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/137007c5e/2b7f515e1e0a4585b611a15f44c2555c [2024-10-24 09:32:46,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:32:46,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:32:46,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:46,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:32:46,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:32:46,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c207ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46, skipping insertion in model container [2024-10-24 09:32:46,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,614 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:32:46,756 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-24 09:32:46,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:46,813 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:32:46,829 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-24 09:32:46,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:32:46,874 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:32:46,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46 WrapperNode [2024-10-24 09:32:46,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:32:46,876 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:46,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:32:46,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:32:46,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,915 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 95 [2024-10-24 09:32:46,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:32:46,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:32:46,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:32:46,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:32:46,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,948 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-24 09:32:46,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:32:46,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:32:46,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:32:46,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:32:46,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (1/1) ... [2024-10-24 09:32:46,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:32:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:32:47,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:32:47,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:32:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:32:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:32:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:32:47,046 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:32:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:32:47,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:32:47,130 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:32:47,132 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:32:47,372 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-24 09:32:47,373 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:32:47,430 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:32:47,431 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:32:47,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:47 BoogieIcfgContainer [2024-10-24 09:32:47,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:32:47,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:32:47,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:32:47,436 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:32:47,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:32:46" (1/3) ... [2024-10-24 09:32:47,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a56229a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:47, skipping insertion in model container [2024-10-24 09:32:47,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:32:46" (2/3) ... [2024-10-24 09:32:47,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a56229a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:32:47, skipping insertion in model container [2024-10-24 09:32:47,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:32:47" (3/3) ... [2024-10-24 09:32:47,439 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-91.i [2024-10-24 09:32:47,459 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:32:47,459 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:32:47,509 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:32:47,516 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;@6929da2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:32:47,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:32:47,521 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-24 09:32:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 09:32:47,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:32:47,529 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-24 09:32:47,529 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:32:47,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:32:47,533 INFO L85 PathProgramCache]: Analyzing trace with hash 824074980, now seen corresponding path program 1 times [2024-10-24 09:32:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:32:47,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956954131] [2024-10-24 09:32:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:32:47,544 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-24 09:32:47,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:32:47,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:32:47,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:32:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:32:47,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 09:32:47,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:32:50,048 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-24 09:32:50,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:33:12,373 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-24 09:33:12,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:33:12,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956954131] [2024-10-24 09:33:12,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956954131] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 09:33:12,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:33:12,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2024-10-24 09:33:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061758259] [2024-10-24 09:33:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:33:12,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 09:33:12,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:33:12,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 09:33:12,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-10-24 09:33:12,396 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-24 09:33:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:33:18,879 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-10-24 09:33:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 09:33:18,883 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-24 09:33:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:33:18,889 INFO L225 Difference]: With dead ends: 112 [2024-10-24 09:33:18,889 INFO L226 Difference]: Without dead ends: 71 [2024-10-24 09:33:18,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-24 09:33:18,894 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 86 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:33:18,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 09:33:18,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-24 09:33:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2024-10-24 09:33:18,925 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-24 09:33:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2024-10-24 09:33:18,928 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 69 [2024-10-24 09:33:18,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:33:18,928 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2024-10-24 09:33:18,928 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-24 09:33:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2024-10-24 09:33:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 09:33:18,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:18,931 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-24 09:33:18,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:33:19,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:33:19,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:19,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 825922022, now seen corresponding path program 1 times [2024-10-24 09:33:19,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:33:19,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400546557] [2024-10-24 09:33:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:19,135 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-24 09:33:19,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:33:19,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:33:19,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:33:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:19,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 09:33:19,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:33:21,818 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-24 09:33:21,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:33:32,995 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-24 09:33:32,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:33:32,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400546557] [2024-10-24 09:33:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400546557] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 09:33:32,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:33:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-10-24 09:33:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51033731] [2024-10-24 09:33:32,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:33:32,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 09:33:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:33:32,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 09:33:32,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-24 09:33:33,000 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-24 09:33:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:33:43,702 INFO L93 Difference]: Finished difference Result 209 states and 279 transitions. [2024-10-24 09:33:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 09:33:43,704 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-24 09:33:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:33:43,707 INFO L225 Difference]: With dead ends: 209 [2024-10-24 09:33:43,709 INFO L226 Difference]: Without dead ends: 144 [2024-10-24 09:33:43,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=349, Invalid=841, Unknown=0, NotChecked=0, Total=1190 [2024-10-24 09:33:43,712 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 137 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s 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, 5.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:33:43,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 208 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-24 09:33:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-24 09:33:43,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 46. [2024-10-24 09:33:43,731 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-24 09:33:43,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2024-10-24 09:33:43,734 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 69 [2024-10-24 09:33:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:33:43,736 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2024-10-24 09:33:43,736 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-24 09:33:43,737 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2024-10-24 09:33:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-24 09:33:43,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:33:43,738 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-24 09:33:43,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:33:43,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:33:43,939 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:33:43,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:33:43,940 INFO L85 PathProgramCache]: Analyzing trace with hash -232664620, now seen corresponding path program 1 times [2024-10-24 09:33:43,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:33:43,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911827430] [2024-10-24 09:33:43,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:33:43,940 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-24 09:33:43,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:33:43,943 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:33:43,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:33:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:33:44,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 09:33:44,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:33:46,113 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-24 09:33:46,113 INFO L311 TraceCheckSpWp]: Computing backward predicates...