./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_operatoramount_amount10_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_operatoramount_amount10_file-22.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 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:59:38,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:59:38,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:59:38,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:59:38,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:59:38,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:59:38,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:59:38,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:59:38,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:59:38,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:59:38,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:59:38,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:59:38,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:59:38,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:59:38,377 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:59:38,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:59:38,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:59:38,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:59:38,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:59:38,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:59:38,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:59:38,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:59:38,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:59:38,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:59:38,381 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:59:38,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:59:38,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:59:38,382 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:59:38,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:59:38,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:59:38,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:59:38,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:59:38,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:38,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:59:38,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:59:38,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:59:38,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:59:38,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:59:38,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:59:38,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:59:38,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:59:38,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:59:38,387 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 -> 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c [2024-10-13 04:59:38,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:59:38,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:59:38,620 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:59:38,621 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:59:38,622 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:59:38,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-10-13 04:59:40,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:59:40,192 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:59:40,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-10-13 04:59:40,205 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ecfa65fc/63e19a9b8b9b43b09c9e60bd3b296b8a/FLAG7948e31c2 [2024-10-13 04:59:40,598 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ecfa65fc/63e19a9b8b9b43b09c9e60bd3b296b8a [2024-10-13 04:59:40,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:59:40,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:59:40,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:40,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:59:40,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:59:40,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:40,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@638292cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40, skipping insertion in model container [2024-10-13 04:59:40,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:40,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:59:40,845 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_operatoramount_amount10_file-22.i[915,928] [2024-10-13 04:59:40,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:40,895 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:59:40,905 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_operatoramount_amount10_file-22.i[915,928] [2024-10-13 04:59:40,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:40,935 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:59:40,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40 WrapperNode [2024-10-13 04:59:40,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:40,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:40,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:59:40,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:59:40,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:40,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:40,982 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2024-10-13 04:59:40,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:40,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:59:40,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:59:40,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:59:40,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:40,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,002 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,023 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-13 04:59:41,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,034 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:59:41,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:59:41,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:59:41,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:59:41,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (1/1) ... [2024-10-13 04:59:41,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:41,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:59:41,082 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-13 04:59:41,091 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-13 04:59:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:59:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:59:41,169 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:59:41,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:59:41,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:59:41,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:59:41,280 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:59:41,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:59:41,428 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:59:41,428 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:59:41,472 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:59:41,472 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:59:41,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:41 BoogieIcfgContainer [2024-10-13 04:59:41,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:59:41,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:59:41,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:59:41,477 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:59:41,477 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:59:40" (1/3) ... [2024-10-13 04:59:41,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61333f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:41, skipping insertion in model container [2024-10-13 04:59:41,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:40" (2/3) ... [2024-10-13 04:59:41,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61333f46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:41, skipping insertion in model container [2024-10-13 04:59:41,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:41" (3/3) ... [2024-10-13 04:59:41,479 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2024-10-13 04:59:41,492 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:59:41,492 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:59:41,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:59:41,539 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;@58467b14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:59:41,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:59:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 04:59:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 04:59:41,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:41,549 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:41,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:41,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash 184138740, now seen corresponding path program 1 times [2024-10-13 04:59:41,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:59:41,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483578422] [2024-10-13 04:59:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:59:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:41,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:59:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:41,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:59:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:59:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 04:59:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:41,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 04:59:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:41,737 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 04:59:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:59:41,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483578422] [2024-10-13 04:59:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483578422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:59:41,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:59:41,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:59:41,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146132319] [2024-10-13 04:59:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:59:41,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:59:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:59:41,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:59:41,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:59:41,765 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 04:59:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:41,798 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2024-10-13 04:59:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:59:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2024-10-13 04:59:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:41,807 INFO L225 Difference]: With dead ends: 47 [2024-10-13 04:59:41,808 INFO L226 Difference]: Without dead ends: 23 [2024-10-13 04:59:41,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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-13 04:59:41,814 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:41,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:59:41,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-13 04:59:41,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-13 04:59:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 04:59:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-13 04:59:41,851 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 36 [2024-10-13 04:59:41,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:41,852 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-13 04:59:41,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-13 04:59:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-13 04:59:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 04:59:41,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:41,855 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:41,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:59:41,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:41,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:41,856 INFO L85 PathProgramCache]: Analyzing trace with hash 343834486, now seen corresponding path program 1 times [2024-10-13 04:59:41,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:59:41,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399710297] [2024-10-13 04:59:41,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:59:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:59:41,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:59:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:59:42,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:59:42,039 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:59:42,041 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:59:42,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:59:42,045 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-13 04:59:42,071 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:59:42,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:59:42 BoogieIcfgContainer [2024-10-13 04:59:42,075 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:59:42,075 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:59:42,075 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:59:42,076 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:59:42,076 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:41" (3/4) ... [2024-10-13 04:59:42,078 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:59:42,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:59:42,079 INFO L158 Benchmark]: Toolchain (without parser) took 1477.54ms. Allocated memory is still 195.0MB. Free memory was 126.8MB in the beginning and 160.4MB in the end (delta: -33.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:59:42,079 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:59:42,080 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.01ms. Allocated memory is still 195.0MB. Free memory was 126.6MB in the beginning and 114.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:59:42,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.53ms. Allocated memory is still 195.0MB. Free memory was 114.1MB in the beginning and 112.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:59:42,081 INFO L158 Benchmark]: Boogie Preprocessor took 50.56ms. Allocated memory is still 195.0MB. Free memory was 112.5MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:59:42,082 INFO L158 Benchmark]: RCFGBuilder took 436.08ms. Allocated memory is still 195.0MB. Free memory was 110.3MB in the beginning and 159.0MB in the end (delta: -48.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-10-13 04:59:42,082 INFO L158 Benchmark]: TraceAbstraction took 600.59ms. Allocated memory is still 195.0MB. Free memory was 158.4MB in the beginning and 161.2MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:59:42,083 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 160.4MB in the end (delta: 737.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:59:42,086 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 109.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.01ms. Allocated memory is still 195.0MB. Free memory was 126.6MB in the beginning and 114.1MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.53ms. Allocated memory is still 195.0MB. Free memory was 114.1MB in the beginning and 112.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.56ms. Allocated memory is still 195.0MB. Free memory was 112.5MB in the beginning and 110.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.08ms. Allocated memory is still 195.0MB. Free memory was 110.3MB in the beginning and 159.0MB in the end (delta: -48.7MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. * TraceAbstraction took 600.59ms. Allocated memory is still 195.0MB. Free memory was 158.4MB in the beginning and 161.2MB in the end (delta: -2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 195.0MB. Free memory was 161.2MB in the beginning and 160.4MB in the end (delta: 737.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] double var_1_2 = 999999.2; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 100.52; [L26] double var_1_5 = 31.2; [L27] float var_1_6 = 5.8; [L58] isInitial = 1 [L59] FCALL initially() [L60] COND TRUE 1 [L61] FCALL updateLastVariables() [L62] CALL updateVariables() [L41] var_1_2 = __VERIFIER_nondet_double() [L42] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L42] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L43] var_1_3 = __VERIFIER_nondet_uchar() [L44] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L44] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L45] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L45] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_5=156/5, var_1_6=29/5] [L46] var_1_5 = __VERIFIER_nondet_double() [L47] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L47] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25, var_1_6=29/5] [L48] var_1_6 = __VERIFIER_nondet_float() [L49] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L49] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L62] RET updateVariables() [L63] CALL step() [L31] COND FALSE !(var_1_2 <= var_1_5) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L36] COND TRUE 1.125 >= var_1_4 [L37] var_1_1 = (! (! var_1_3)) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L63] RET step() [L64] CALL, EXPR property() [L54-L55] return ((1.125 >= var_1_4) ? (var_1_1 == ((unsigned char) (! (! var_1_3)))) : 1) && ((var_1_2 <= var_1_5) ? ((! var_1_3) ? (var_1_4 == ((float) var_1_6)) : 1) : 1) ; [L64] RET, EXPR property() [L64] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_3=0, var_1_4=2513/25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 27 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 35 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 40/40 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-13 04:59:42,112 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_operatoramount_amount10_file-22.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 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:59:44,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:59:44,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:59:44,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:59:44,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:59:44,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:59:44,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:59:44,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:59:44,311 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:59:44,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:59:44,312 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:59:44,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:59:44,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:59:44,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:59:44,315 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:59:44,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:59:44,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:59:44,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:59:44,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:59:44,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:59:44,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:59:44,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:59:44,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:59:44,320 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:59:44,320 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:59:44,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:59:44,320 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:59:44,321 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:59:44,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:59:44,321 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:59:44,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:59:44,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:59:44,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:59:44,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:59:44,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:44,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:59:44,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:59:44,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:59:44,323 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:59:44,323 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:59:44,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:59:44,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:59:44,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:59:44,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:59:44,324 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:59:44,324 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 -> 980b1737abc4897cffcf9ffd697bb8a6c2567cb964b43bf5603c43f896e3728c [2024-10-13 04:59:44,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:59:44,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:59:44,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:59:44,624 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:59:44,625 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:59:44,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-10-13 04:59:46,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:59:46,291 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:59:46,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i [2024-10-13 04:59:46,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abf722d4/fce16722c39e4b25ada586c62b5263f4/FLAG8a0169a4b [2024-10-13 04:59:46,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5abf722d4/fce16722c39e4b25ada586c62b5263f4 [2024-10-13 04:59:46,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:59:46,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:59:46,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:46,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:59:46,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:59:46,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:46,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743da56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46, skipping insertion in model container [2024-10-13 04:59:46,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:46,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:59:46,861 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-22.i[915,928] [2024-10-13 04:59:46,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:46,906 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:59:46,919 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_operatoramount_amount10_file-22.i[915,928] [2024-10-13 04:59:46,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:59:46,952 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:59:46,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46 WrapperNode [2024-10-13 04:59:46,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:59:46,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:46,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:59:46,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:59:46,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:46,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:46,991 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 62 [2024-10-13 04:59:46,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:59:46,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:59:46,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:59:46,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:59:47,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,017 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,034 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-13 04:59:47,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,039 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,059 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:59:47,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:59:47,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:59:47,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:59:47,066 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (1/1) ... [2024-10-13 04:59:47,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:59:47,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:59:47,103 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-13 04:59:47,112 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-13 04:59:47,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:59:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:59:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:59:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:59:47,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:59:47,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:59:47,203 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:59:47,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:59:47,509 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-13 04:59:47,511 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:59:47,558 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:59:47,560 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:59:47,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:47 BoogieIcfgContainer [2024-10-13 04:59:47,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:59:47,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:59:47,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:59:47,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:59:47,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:59:46" (1/3) ... [2024-10-13 04:59:47,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdc8d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:47, skipping insertion in model container [2024-10-13 04:59:47,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:59:46" (2/3) ... [2024-10-13 04:59:47,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cdc8d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:59:47, skipping insertion in model container [2024-10-13 04:59:47,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:47" (3/3) ... [2024-10-13 04:59:47,568 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-22.i [2024-10-13 04:59:47,580 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:59:47,581 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:59:47,633 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:59:47,639 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;@5217745d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:59:47,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:59:47,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 04:59:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 04:59:47,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:47,651 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:47,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:47,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash 184138740, now seen corresponding path program 1 times [2024-10-13 04:59:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018596586] [2024-10-13 04:59:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:47,667 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-13 04:59:47,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:47,670 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-13 04:59:47,674 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-13 04:59:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:47,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:59:47,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-13 04:59:47,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:59:47,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:59:47,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018596586] [2024-10-13 04:59:47,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018596586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:59:47,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:59:47,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:59:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239514274] [2024-10-13 04:59:47,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:59:47,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:59:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:59:47,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:59:47,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:59:47,901 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 18 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:47,980 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2024-10-13 04:59:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:59:47,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-10-13 04:59:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:47,992 INFO L225 Difference]: With dead ends: 47 [2024-10-13 04:59:47,992 INFO L226 Difference]: Without dead ends: 23 [2024-10-13 04:59:47,995 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-13 04:59:47,998 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:48,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:59:48,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-13 04:59:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-10-13 04:59:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-13 04:59:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2024-10-13 04:59:48,034 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 36 [2024-10-13 04:59:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:48,035 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2024-10-13 04:59:48,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2024-10-13 04:59:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 04:59:48,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:48,037 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:48,044 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-13 04:59:48,238 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-13 04:59:48,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:48,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:48,241 INFO L85 PathProgramCache]: Analyzing trace with hash 343834486, now seen corresponding path program 1 times [2024-10-13 04:59:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:48,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1463079254] [2024-10-13 04:59:48,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:48,244 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-13 04:59:48,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:48,247 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-13 04:59:48,248 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-13 04:59:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:48,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:59:48,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 04:59:48,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:59:48,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:59:48,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1463079254] [2024-10-13 04:59:48,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1463079254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:59:48,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:59:48,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:59:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401516702] [2024-10-13 04:59:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:59:48,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:59:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:59:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:59:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:59:48,587 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:48,836 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-10-13 04:59:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:59:48,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-10-13 04:59:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:48,841 INFO L225 Difference]: With dead ends: 67 [2024-10-13 04:59:48,842 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 04:59:48,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:59:48,844 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:48,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:59:48,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 04:59:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-10-13 04:59:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:59:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-10-13 04:59:48,867 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 36 [2024-10-13 04:59:48,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:48,867 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-10-13 04:59:48,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-10-13 04:59:48,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-13 04:59:48,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:48,868 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:48,875 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-13 04:59:49,073 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-13 04:59:49,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:49,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash 343894068, now seen corresponding path program 1 times [2024-10-13 04:59:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:49,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004257913] [2024-10-13 04:59:49,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:49,075 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-13 04:59:49,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:49,077 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-13 04:59:49,078 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-13 04:59:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:49,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 04:59:49,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-13 04:59:49,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:59:49,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:59:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004257913] [2024-10-13 04:59:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004257913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:59:49,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:59:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:59:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593922278] [2024-10-13 04:59:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:59:49,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:59:49,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:59:49,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:59:49,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:59:49,733 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:50,161 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-13 04:59:50,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:59:50,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2024-10-13 04:59:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:50,164 INFO L225 Difference]: With dead ends: 52 [2024-10-13 04:59:50,166 INFO L226 Difference]: Without dead ends: 50 [2024-10-13 04:59:50,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:59:50,167 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:50,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 71 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 04:59:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-13 04:59:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2024-10-13 04:59:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:59:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2024-10-13 04:59:50,184 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 36 [2024-10-13 04:59:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:50,185 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2024-10-13 04:59:50,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2024-10-13 04:59:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 04:59:50,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:50,188 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:50,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 04:59:50,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:59:50,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:50,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:50,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1832132531, now seen corresponding path program 1 times [2024-10-13 04:59:50,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:50,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595337235] [2024-10-13 04:59:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:50,391 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-13 04:59:50,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:50,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:59:50,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 04:59:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:50,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 04:59:50,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-13 04:59:50,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 04:59:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 04:59:50,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:59:50,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595337235] [2024-10-13 04:59:50,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595337235] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 04:59:50,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 04:59:50,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-13 04:59:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011280555] [2024-10-13 04:59:50,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 04:59:50,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 04:59:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:59:50,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 04:59:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:59:50,619 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 04:59:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:50,830 INFO L93 Difference]: Finished difference Result 100 states and 125 transitions. [2024-10-13 04:59:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 04:59:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 37 [2024-10-13 04:59:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:50,834 INFO L225 Difference]: With dead ends: 100 [2024-10-13 04:59:50,834 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 04:59:50,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-13 04:59:50,835 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:50,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 40 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 04:59:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 04:59:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-13 04:59:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-13 04:59:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2024-10-13 04:59:50,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 37 [2024-10-13 04:59:50,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:50,841 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2024-10-13 04:59:50,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-13 04:59:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2024-10-13 04:59:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 04:59:50,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:50,842 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:50,849 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 (5)] Ended with exit code 0 [2024-10-13 04:59:51,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:59:51,043 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:51,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1830225907, now seen corresponding path program 1 times [2024-10-13 04:59:51,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:51,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670276236] [2024-10-13 04:59:51,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:51,046 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-13 04:59:51,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:51,048 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 04:59:51,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 04:59:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:51,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 04:59:51,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 04:59:52,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:59:52,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:59:52,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670276236] [2024-10-13 04:59:52,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670276236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:59:52,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:59:52,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 04:59:52,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226088954] [2024-10-13 04:59:52,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:59:52,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 04:59:52,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:59:52,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 04:59:52,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 04:59:52,513 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:59:53,457 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2024-10-13 04:59:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 04:59:53,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2024-10-13 04:59:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:59:53,461 INFO L225 Difference]: With dead ends: 98 [2024-10-13 04:59:53,461 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 04:59:53,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-10-13 04:59:53,462 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 04:59:53,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 103 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 04:59:53,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 04:59:53,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 68. [2024-10-13 04:59:53,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 50 states have internal predecessors, (54), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 04:59:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-10-13 04:59:53,471 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 37 [2024-10-13 04:59:53,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:59:53,472 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-10-13 04:59:53,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 04:59:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-10-13 04:59:53,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-13 04:59:53,473 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:59:53,473 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:59:53,479 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 (6)] Forceful destruction successful, exit code 0 [2024-10-13 04:59:53,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-13 04:59:53,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:59:53,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:59:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1830285489, now seen corresponding path program 1 times [2024-10-13 04:59:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:59:53,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215170568] [2024-10-13 04:59:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:59:53,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:59:53,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:59:53,680 INFO L229 MonitoredProcess]: Starting monitored process 7 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-13 04:59:53,681 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 (7)] Waiting until timeout for monitored process [2024-10-13 04:59:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:59:53,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 04:59:53,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:59:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 04:59:54,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 05:00:00,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:00:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215170568] [2024-10-13 05:00:00,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215170568] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 05:00:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [721497186] [2024-10-13 05:00:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:00:00,698 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 05:00:00,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 05:00:00,701 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 05:00:00,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-13 05:00:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:00:01,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 05:00:01,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:00:06,519 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-13 05:00:06,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:00:06,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [721497186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:00:06,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 05:00:06,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2024-10-13 05:00:06,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747015469] [2024-10-13 05:00:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:00:06,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 05:00:06,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:00:06,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 05:00:06,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-13 05:00:06,521 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 05:00:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:00:10,061 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2024-10-13 05:00:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 05:00:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2024-10-13 05:00:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:00:10,064 INFO L225 Difference]: With dead ends: 78 [2024-10-13 05:00:10,064 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 05:00:10,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2024-10-13 05:00:10,065 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 05:00:10,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 71 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 05:00:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 05:00:10,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2024-10-13 05:00:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 05:00:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-10-13 05:00:10,099 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2024-10-13 05:00:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:00:10,100 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-10-13 05:00:10,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 05:00:10,105 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-10-13 05:00:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:00:10,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:00:10,107 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:00:10,124 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 05:00:10,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-10-13 05:00:10,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-13 05:00:10,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:00:10,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:00:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1519236361, now seen corresponding path program 1 times [2024-10-13 05:00:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:00:10,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [395620580] [2024-10-13 05:00:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:00:10,510 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-13 05:00:10,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:00:10,514 INFO L229 MonitoredProcess]: Starting monitored process 9 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-13 05:00:10,515 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 (9)] Waiting until timeout for monitored process [2024-10-13 05:00:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:00:10,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:00:10,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:00:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-10-13 05:00:11,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:00:11,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:00:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [395620580] [2024-10-13 05:00:11,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [395620580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:00:11,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:00:11,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:00:11,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730664665] [2024-10-13 05:00:11,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:00:11,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:00:11,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:00:11,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:00:11,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:00:11,919 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 05:00:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:00:12,336 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2024-10-13 05:00:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:00:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 72 [2024-10-13 05:00:12,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:00:12,338 INFO L225 Difference]: With dead ends: 79 [2024-10-13 05:00:12,338 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 05:00:12,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:00:12,339 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 05:00:12,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 05:00:12,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 05:00:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2024-10-13 05:00:12,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 52 states have internal predecessors, (56), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-13 05:00:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-10-13 05:00:12,363 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 72 [2024-10-13 05:00:12,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:00:12,363 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-10-13 05:00:12,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 05:00:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-10-13 05:00:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:00:12,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:00:12,367 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:00:12,377 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 (9)] Forceful destruction successful, exit code 0 [2024-10-13 05:00:12,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-13 05:00:12,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:00:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:00:12,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1519176779, now seen corresponding path program 1 times [2024-10-13 05:00:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:00:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643878457] [2024-10-13 05:00:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:00:12,575 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-13 05:00:12,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:00:12,577 INFO L229 MonitoredProcess]: Starting monitored process 10 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-13 05:00:12,581 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 (10)] Waiting until timeout for monitored process [2024-10-13 05:00:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:00:12,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 05:00:12,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:00:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-13 05:00:15,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:00:15,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:00:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643878457] [2024-10-13 05:00:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643878457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:00:15,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:00:15,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:00:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020033262] [2024-10-13 05:00:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:00:15,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:00:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:00:15,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:00:15,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:00:15,563 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 05:00:16,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:00:16,509 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2024-10-13 05:00:16,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:00:16,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2024-10-13 05:00:16,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:00:16,518 INFO L225 Difference]: With dead ends: 140 [2024-10-13 05:00:16,518 INFO L226 Difference]: Without dead ends: 98 [2024-10-13 05:00:16,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:00:16,519 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 05:00:16,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 65 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 05:00:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-13 05:00:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-13 05:00:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 71 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 05:00:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2024-10-13 05:00:16,542 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 72 [2024-10-13 05:00:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:00:16,542 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2024-10-13 05:00:16,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-13 05:00:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2024-10-13 05:00:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-13 05:00:16,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:00:16,543 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:00:16,555 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 (10)] Forceful destruction successful, exit code 0 [2024-10-13 05:00:16,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-13 05:00:16,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:00:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:00:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash 930423351, now seen corresponding path program 1 times [2024-10-13 05:00:16,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:00:16,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872091464] [2024-10-13 05:00:16,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:00:16,747 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-13 05:00:16,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:00:16,749 INFO L229 MonitoredProcess]: Starting monitored process 11 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-13 05:00:16,750 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 (11)] Waiting until timeout for monitored process [2024-10-13 05:00:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:00:16,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 05:00:16,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:00:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2024-10-13 05:00:18,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:00:18,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:00:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872091464] [2024-10-13 05:00:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872091464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:00:18,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:00:18,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 05:00:18,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961005664] [2024-10-13 05:00:18,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:00:18,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 05:00:18,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:00:18,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 05:00:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:00:18,680 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 05:00:20,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:00:20,245 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-10-13 05:00:20,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 05:00:20,251 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 72 [2024-10-13 05:00:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:00:20,252 INFO L225 Difference]: With dead ends: 99 [2024-10-13 05:00:20,252 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 05:00:20,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 05:00:20,253 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:00:20,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 83 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 05:00:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 05:00:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 05:00:20,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 05:00:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 05:00:20,254 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-13 05:00:20,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:00:20,254 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 05:00:20,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-13 05:00:20,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 05:00:20,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 05:00:20,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:00:20,270 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 (11)] Ended with exit code 0 [2024-10-13 05:00:20,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-13 05:00:20,467 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 05:00:20,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 05:00:30,092 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:00:30,103 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,104 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,104 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,104 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,104 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,104 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-13 05:00:30,110 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,110 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-13 05:00:30,110 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,111 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,111 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,111 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,111 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,111 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-13 05:00:30,112 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,112 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-13 05:00:30,112 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,113 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,113 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,113 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,113 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-13 05:00:30,113 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-13 05:00:30,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:00:30 BoogieIcfgContainer [2024-10-13 05:00:30,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:00:30,117 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:00:30,117 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:00:30,117 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:00:30,118 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:59:47" (3/4) ... [2024-10-13 05:00:30,119 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 05:00:30,122 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-13 05:00:30,126 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-13 05:00:30,126 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-13 05:00:30,126 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 05:00:30,126 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 05:00:30,217 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 05:00:30,217 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 05:00:30,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:00:30,218 INFO L158 Benchmark]: Toolchain (without parser) took 43557.49ms. Allocated memory was 65.0MB in the beginning and 109.1MB in the end (delta: 44.0MB). Free memory was 41.3MB in the beginning and 37.0MB in the end (delta: 4.3MB). Peak memory consumption was 47.6MB. Max. memory is 16.1GB. [2024-10-13 05:00:30,218 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 65.0MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:00:30,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.90ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 28.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 05:00:30,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.00ms. Allocated memory is still 90.2MB. Free memory was 70.8MB in the beginning and 69.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:00:30,219 INFO L158 Benchmark]: Boogie Preprocessor took 68.83ms. Allocated memory is still 90.2MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:00:30,220 INFO L158 Benchmark]: RCFGBuilder took 498.98ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 52.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 05:00:30,220 INFO L158 Benchmark]: TraceAbstraction took 42554.61ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.0MB in the beginning and 42.3MB in the end (delta: 9.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2024-10-13 05:00:30,220 INFO L158 Benchmark]: Witness Printer took 100.89ms. Allocated memory is still 109.1MB. Free memory was 42.3MB in the beginning and 37.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:00:30,222 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.22ms. Allocated memory is still 65.0MB. Free memory was 41.4MB in the beginning and 41.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.90ms. Allocated memory is still 65.0MB. Free memory was 41.2MB in the beginning and 28.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.00ms. Allocated memory is still 90.2MB. Free memory was 70.8MB in the beginning and 69.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.83ms. Allocated memory is still 90.2MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.98ms. Allocated memory is still 90.2MB. Free memory was 67.0MB in the beginning and 52.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 42554.61ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.0MB in the beginning and 42.3MB in the end (delta: 9.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Witness Printer took 100.89ms. Allocated memory is still 109.1MB. Free memory was 42.3MB in the beginning and 37.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.9s, OverallIterations: 9, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 591 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 357 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 495 IncrementalHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 234 mSDtfsCounter, 495 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 525 GetRequests, 463 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 53 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 498 ConstructedInterpolants, 0 QuantifiedInterpolants, 2316 SizeOfPredicates, 46 NumberOfNonLiveVariables, 804 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 887/902 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (var_1_3 <= 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-10-13 05:00:30,312 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 Writing output log to file Ultimate.log Result: TRUE