./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c --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/float-newlib/double_req_bl_1252b.c -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 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:22:35,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:22:35,631 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 17:22:35,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:22:35,640 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:22:35,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:22:35,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:22:35,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:22:35,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:22:35,674 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:22:35,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:22:35,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:22:35,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:22:35,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:22:35,676 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:22:35,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:22:35,678 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:22:35,678 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:22:35,678 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 17:22:35,678 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:22:35,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:22:35,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:22:35,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:22:35,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:22:35,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:22:35,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:22:35,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:22:35,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:22:35,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:22:35,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:22:35,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:22:35,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:22:35,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:35,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:22:35,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:22:35,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:22:35,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 17:22:35,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 17:22:35,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:22:35,685 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:22:35,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:22:35,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:22:35,685 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 -> 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 [2024-10-12 17:22:35,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:22:35,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:22:35,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:22:35,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:22:35,953 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:22:35,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-10-12 17:22:37,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:22:37,607 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:22:37,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-10-12 17:22:37,616 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab8d617c8/c18dbc0438ff42d1a13479f5baf5e4d7/FLAGc081b8cef [2024-10-12 17:22:37,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab8d617c8/c18dbc0438ff42d1a13479f5baf5e4d7 [2024-10-12 17:22:38,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:22:38,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:22:38,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:38,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:22:38,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:22:38,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:37" (1/1) ... [2024-10-12 17:22:38,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef7266d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38, skipping insertion in model container [2024-10-12 17:22:38,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:37" (1/1) ... [2024-10-12 17:22:38,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:22:38,285 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/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-10-12 17:22:38,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:38,299 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:22:38,329 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/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-10-12 17:22:38,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:38,351 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:22:38,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38 WrapperNode [2024-10-12 17:22:38,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:38,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:38,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:22:38,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:22:38,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,384 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-10-12 17:22:38,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:38,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:22:38,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:22:38,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:22:38,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,412 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-12 17:22:38,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,424 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,427 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:22:38,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:22:38,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:22:38,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:22:38,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (1/1) ... [2024-10-12 17:22:38,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:38,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:22:38,465 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-12 17:22:38,471 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-12 17:22:38,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:22:38,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 17:22:38,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 17:22:38,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 17:22:38,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:22:38,516 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-12 17:22:38,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-12 17:22:38,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-12 17:22:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-12 17:22:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-12 17:22:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:22:38,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:22:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 17:22:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 17:22:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-12 17:22:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:22:38,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:22:38,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:22:38,827 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-12 17:22:38,828 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:22:38,863 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:22:38,863 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 17:22:38,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:38 BoogieIcfgContainer [2024-10-12 17:22:38,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:22:38,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:22:38,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:22:38,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:22:38,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:22:37" (1/3) ... [2024-10-12 17:22:38,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318e9c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:38, skipping insertion in model container [2024-10-12 17:22:38,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:38" (2/3) ... [2024-10-12 17:22:38,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318e9c00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:38, skipping insertion in model container [2024-10-12 17:22:38,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:38" (3/3) ... [2024-10-12 17:22:38,875 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2024-10-12 17:22:38,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:22:38,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:22:38,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:22:38,956 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;@78086119, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:22:38,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:22:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 17:22:38,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 17:22:38,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:38,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:38,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:38,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2030686387, now seen corresponding path program 1 times [2024-10-12 17:22:38,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546945328] [2024-10-12 17:22:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:39,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:22:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:39,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:39,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546945328] [2024-10-12 17:22:39,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546945328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:39,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 17:22:39,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25756581] [2024-10-12 17:22:39,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:39,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 17:22:39,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:39,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 17:22:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 17:22:39,188 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:39,226 INFO L93 Difference]: Finished difference Result 50 states and 75 transitions. [2024-10-12 17:22:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 17:22:39,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-12 17:22:39,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:39,236 INFO L225 Difference]: With dead ends: 50 [2024-10-12 17:22:39,237 INFO L226 Difference]: Without dead ends: 24 [2024-10-12 17:22:39,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12 17:22:39,243 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:39,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:39,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-10-12 17:22:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-12 17:22:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 17:22:39,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-12 17:22:39,300 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-10-12 17:22:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:39,301 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-12 17:22:39,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-12 17:22:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 17:22:39,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:39,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:39,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 17:22:39,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:39,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1660176756, now seen corresponding path program 1 times [2024-10-12 17:22:39,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:39,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311887698] [2024-10-12 17:22:39,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:39,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:39,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:22:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:39,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311887698] [2024-10-12 17:22:39,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311887698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:39,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:39,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:22:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173617442] [2024-10-12 17:22:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:39,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:22:39,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:22:39,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:39,604 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:39,656 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-12 17:22:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:22:39,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-12 17:22:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:39,661 INFO L225 Difference]: With dead ends: 36 [2024-10-12 17:22:39,661 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 17:22:39,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:39,664 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:39,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 17:22:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-12 17:22:39,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:22:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-12 17:22:39,672 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2024-10-12 17:22:39,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:39,673 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 17:22:39,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-12 17:22:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 17:22:39,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:39,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 17:22:39,675 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1141436138, now seen corresponding path program 1 times [2024-10-12 17:22:39,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:39,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060356254] [2024-10-12 17:22:39,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:39,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:22:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:39,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:39,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060356254] [2024-10-12 17:22:39,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060356254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:39,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:39,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:22:39,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994491761] [2024-10-12 17:22:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:39,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:22:39,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:39,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:22:39,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:39,895 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:39,952 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-12 17:22:39,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:22:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 17:22:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:39,954 INFO L225 Difference]: With dead ends: 40 [2024-10-12 17:22:39,954 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 17:22:39,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:39,956 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:39,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:39,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 17:22:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-12 17:22:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:22:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-12 17:22:39,964 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2024-10-12 17:22:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 17:22:39,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:39,964 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-12 17:22:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 17:22:39,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:39,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:39,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 17:22:39,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:39,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash -731973192, now seen corresponding path program 1 times [2024-10-12 17:22:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:39,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905332867] [2024-10-12 17:22:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:22:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:40,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905332867] [2024-10-12 17:22:40,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905332867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:40,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:40,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:22:40,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313266838] [2024-10-12 17:22:40,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:40,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:22:40,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:40,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:22:40,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:40,110 INFO L87 Difference]: Start difference. First operand 28 states and 36 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:40,161 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-12 17:22:40,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:22:40,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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-12 17:22:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:40,163 INFO L225 Difference]: With dead ends: 40 [2024-10-12 17:22:40,163 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 17:22:40,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:40,164 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:40,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 17:22:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-12 17:22:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:22:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-12 17:22:40,174 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2024-10-12 17:22:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:40,175 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 17:22:40,175 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:40,175 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-12 17:22:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 17:22:40,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:40,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:40,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 17:22:40,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:40,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash 436592986, now seen corresponding path program 1 times [2024-10-12 17:22:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:40,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946752476] [2024-10-12 17:22:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:40,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 17:22:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 17:22:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946752476] [2024-10-12 17:22:40,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946752476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:40,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:40,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:22:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538656179] [2024-10-12 17:22:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:40,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:22:40,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 17:22:40,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:22:40,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:40,306 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:40,360 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2024-10-12 17:22:40,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:22:40,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-10-12 17:22:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:40,362 INFO L225 Difference]: With dead ends: 40 [2024-10-12 17:22:40,362 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 17:22:40,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:40,363 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:40,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 109 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 17:22:40,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-10-12 17:22:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:22:40,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2024-10-12 17:22:40,377 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2024-10-12 17:22:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:40,378 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2024-10-12 17:22:40,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:40,378 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2024-10-12 17:22:40,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-12 17:22:40,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:40,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:40,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 17:22:40,382 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:40,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1370861477, now seen corresponding path program 1 times [2024-10-12 17:22:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 17:22:40,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605039601] [2024-10-12 17:22:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:40,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 17:22:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:22:40,408 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 17:22:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:22:40,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 17:22:40,442 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 17:22:40,443 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:22:40,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 17:22:40,452 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-12 17:22:40,474 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:22:40,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:22:40 BoogieIcfgContainer [2024-10-12 17:22:40,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:22:40,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:22:40,483 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:22:40,483 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:22:40,484 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:38" (3/4) ... [2024-10-12 17:22:40,486 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 17:22:40,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:22:40,488 INFO L158 Benchmark]: Toolchain (without parser) took 2486.05ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 67.8MB in the beginning and 81.3MB in the end (delta: -13.5MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-10-12 17:22:40,489 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:40,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.40ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 67.6MB in the beginning and 160.4MB in the end (delta: -92.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-12 17:22:40,489 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.85ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 159.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:40,490 INFO L158 Benchmark]: Boogie Preprocessor took 41.56ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:40,490 INFO L158 Benchmark]: RCFGBuilder took 436.95ms. Allocated memory is still 190.8MB. Free memory was 156.2MB in the beginning and 140.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 17:22:40,490 INFO L158 Benchmark]: TraceAbstraction took 1615.39ms. Allocated memory is still 190.8MB. Free memory was 139.4MB in the beginning and 81.3MB in the end (delta: 58.2MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:40,491 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 190.8MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:40,492 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.17ms. Allocated memory is still 136.3MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.40ms. Allocated memory was 136.3MB in the beginning and 190.8MB in the end (delta: 54.5MB). Free memory was 67.6MB in the beginning and 160.4MB in the end (delta: -92.8MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.85ms. Allocated memory is still 190.8MB. Free memory was 160.4MB in the beginning and 159.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.56ms. Allocated memory is still 190.8MB. Free memory was 159.4MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 436.95ms. Allocated memory is still 190.8MB. Free memory was 156.2MB in the beginning and 140.5MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1615.39ms. Allocated memory is still 190.8MB. Free memory was 139.4MB in the beginning and 81.3MB in the end (delta: 58.2MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 190.8MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 87]: 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 86, overapproximation of someUnaryDOUBLEoperation at line 82. Possible FailurePath: [L81] double x = 0.0; [L82] double y = -0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; VAL [\old(x)=0, \result=0, x=0] [L54] RET, EXPR __fpclassify_double(x) VAL [x=0] [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; VAL [\result=4294967306, x=0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=4294967306] [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() VAL [res=4294967306] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 474 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 148 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 23, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 162 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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-12 17:22:40,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c -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 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 17:22:42,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 17:22:42,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 17:22:42,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 17:22:42,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 17:22:42,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 17:22:42,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 17:22:42,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 17:22:42,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 17:22:42,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 17:22:42,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 17:22:42,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 17:22:42,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 17:22:42,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 17:22:42,796 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 17:22:42,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 17:22:42,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 17:22:42,797 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 17:22:42,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 17:22:42,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 17:22:42,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 17:22:42,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 17:22:42,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 17:22:42,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 17:22:42,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 17:22:42,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 17:22:42,802 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 17:22:42,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 17:22:42,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 17:22:42,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 17:22:42,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 17:22:42,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 17:22:42,803 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 17:22:42,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 17:22:42,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:42,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 17:22:42,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 17:22:42,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 17:22:42,806 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 17:22:42,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 17:22:42,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 17:22:42,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 17:22:42,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 17:22:42,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 17:22:42,808 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 17:22:42,808 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 -> 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 [2024-10-12 17:22:43,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 17:22:43,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 17:22:43,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 17:22:43,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 17:22:43,172 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 17:22:43,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-10-12 17:22:44,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 17:22:44,976 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 17:22:44,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-10-12 17:22:44,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12be7e9e7/412c09b0b12943fd95a8f8adcbf55215/FLAG33bff3d0e [2024-10-12 17:22:45,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12be7e9e7/412c09b0b12943fd95a8f8adcbf55215 [2024-10-12 17:22:45,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 17:22:45,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 17:22:45,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:45,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 17:22:45,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 17:22:45,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad280ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45, skipping insertion in model container [2024-10-12 17:22:45,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 17:22:45,283 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/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-10-12 17:22:45,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:45,308 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 17:22:45,335 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/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-10-12 17:22:45,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 17:22:45,360 INFO L204 MainTranslator]: Completed translation [2024-10-12 17:22:45,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45 WrapperNode [2024-10-12 17:22:45,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 17:22:45,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:45,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 17:22:45,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 17:22:45,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,406 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-10-12 17:22:45,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 17:22:45,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 17:22:45,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 17:22:45,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 17:22:45,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,423 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,443 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-10-12 17:22:45,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 17:22:45,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 17:22:45,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 17:22:45,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 17:22:45,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (1/1) ... [2024-10-12 17:22:45,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 17:22:45,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 17:22:45,515 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-12 17:22:45,517 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-12 17:22:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 17:22:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-12 17:22:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-12 17:22:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-10-12 17:22:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 17:22:45,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-12 17:22:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-12 17:22:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 17:22:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-10-12 17:22:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-10-12 17:22:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-12 17:22:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-12 17:22:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-12 17:22:45,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 17:22:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 17:22:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 17:22:45,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 17:22:45,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 17:22:45,894 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-12 17:22:45,894 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 17:22:45,931 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 17:22:45,931 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 17:22:45,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:45 BoogieIcfgContainer [2024-10-12 17:22:45,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 17:22:45,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 17:22:45,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 17:22:45,939 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 17:22:45,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 05:22:45" (1/3) ... [2024-10-12 17:22:45,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535bf062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:45, skipping insertion in model container [2024-10-12 17:22:45,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 05:22:45" (2/3) ... [2024-10-12 17:22:45,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535bf062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 05:22:45, skipping insertion in model container [2024-10-12 17:22:45,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:45" (3/3) ... [2024-10-12 17:22:45,942 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2024-10-12 17:22:45,961 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 17:22:45,961 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 17:22:46,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 17:22:46,030 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;@f2acc09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 17:22:46,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 17:22:46,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 17:22:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 17:22:46,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:46,043 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:46,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:46,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1087397120, now seen corresponding path program 1 times [2024-10-12 17:22:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:46,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573352060] [2024-10-12 17:22:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:46,063 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-12 17:22:46,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:46,066 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-12 17:22:46,068 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-12 17:22:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:46,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 17:22:46,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:46,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:46,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:46,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573352060] [2024-10-12 17:22:46,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573352060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:46,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:46,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 17:22:46,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569375442] [2024-10-12 17:22:46,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:46,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 17:22:46,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:46,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 17:22:46,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 17:22:46,218 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 20 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:46,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:46,247 INFO L93 Difference]: Finished difference Result 46 states and 71 transitions. [2024-10-12 17:22:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 17:22:46,250 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-12 17:22:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:46,257 INFO L225 Difference]: With dead ends: 46 [2024-10-12 17:22:46,257 INFO L226 Difference]: Without dead ends: 22 [2024-10-12 17:22:46,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-12 17:22:46,264 INFO L432 NwaCegarLoop]: 28 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, 28 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-12 17:22:46,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 17:22:46,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-12 17:22:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-12 17:22:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 17:22:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2024-10-12 17:22:46,302 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 12 [2024-10-12 17:22:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:46,303 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2024-10-12 17:22:46,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2024-10-12 17:22:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 17:22:46,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:46,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:46,311 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-12 17:22:46,513 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-12 17:22:46,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:46,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:46,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1335499105, now seen corresponding path program 1 times [2024-10-12 17:22:46,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343714052] [2024-10-12 17:22:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:46,516 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-12 17:22:46,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:46,519 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-12 17:22:46,520 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-12 17:22:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:46,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:22:46,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:46,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:46,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:46,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343714052] [2024-10-12 17:22:46,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343714052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:46,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:46,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:22:46,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367518691] [2024-10-12 17:22:46,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:46,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:22:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:22:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:46,657 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:46,978 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2024-10-12 17:22:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:22:46,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-12 17:22:46,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:46,980 INFO L225 Difference]: With dead ends: 33 [2024-10-12 17:22:46,981 INFO L226 Difference]: Without dead ends: 25 [2024-10-12 17:22:46,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:46,982 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 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.3s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:46,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 17:22:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-12 17:22:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-12 17:22:46,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 17:22:46,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-12 17:22:46,993 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2024-10-12 17:22:46,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:46,994 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-12 17:22:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:46,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-12 17:22:46,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-12 17:22:46,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:46,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:47,000 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 (3)] Ended with exit code 0 [2024-10-12 17:22:47,196 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-12 17:22:47,197 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -710780355, now seen corresponding path program 1 times [2024-10-12 17:22:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:47,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593252571] [2024-10-12 17:22:47,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:47,199 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-12 17:22:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:47,202 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-12 17:22:47,204 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-12 17:22:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:47,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 17:22:47,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:47,494 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:47,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:47,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593252571] [2024-10-12 17:22:47,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593252571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:47,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:47,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 17:22:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24518993] [2024-10-12 17:22:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:47,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 17:22:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 17:22:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 17:22:47,501 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:47,834 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2024-10-12 17:22:47,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 17:22:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-10-12 17:22:47,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:47,836 INFO L225 Difference]: With dead ends: 50 [2024-10-12 17:22:47,836 INFO L226 Difference]: Without dead ends: 28 [2024-10-12 17:22:47,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 17:22:47,838 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:47,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 17:22:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-12 17:22:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-10-12 17:22:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 17:22:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-12 17:22:47,845 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-10-12 17:22:47,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:47,845 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-12 17:22:47,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:47,845 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-12 17:22:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-12 17:22:47,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:47,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:47,851 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 (4)] Forceful destruction successful, exit code 0 [2024-10-12 17:22:48,046 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-12 17:22:48,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:48,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash -143061541, now seen corresponding path program 1 times [2024-10-12 17:22:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:48,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201449049] [2024-10-12 17:22:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:48,049 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-12 17:22:48,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:48,052 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-12 17:22:48,053 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-12 17:22:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:48,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:22:48,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:48,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:48,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:48,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201449049] [2024-10-12 17:22:48,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201449049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:48,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:48,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:22:48,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346542773] [2024-10-12 17:22:48,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:48,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:22:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:22:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:48,150 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:48,302 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2024-10-12 17:22:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:22:48,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-12 17:22:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:48,304 INFO L225 Difference]: With dead ends: 38 [2024-10-12 17:22:48,304 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 17:22:48,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:48,305 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:48,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 17:22:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 17:22:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-12 17:22:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 17:22:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-10-12 17:22:48,312 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2024-10-12 17:22:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:48,313 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-10-12 17:22:48,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-10-12 17:22:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 17:22:48,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:48,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:48,318 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-12 17:22:48,517 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-12 17:22:48,518 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:48,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:48,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1342340743, now seen corresponding path program 1 times [2024-10-12 17:22:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:48,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078614459] [2024-10-12 17:22:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:48,519 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-12 17:22:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:48,521 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-12 17:22:48,521 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-12 17:22:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:48,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 17:22:48,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 17:22:48,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:48,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078614459] [2024-10-12 17:22:48,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078614459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:48,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:48,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 17:22:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103368518] [2024-10-12 17:22:48,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:48,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 17:22:48,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:48,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 17:22:48,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 17:22:48,722 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:48,970 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2024-10-12 17:22:48,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 17:22:48,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-10-12 17:22:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:48,972 INFO L225 Difference]: With dead ends: 50 [2024-10-12 17:22:48,972 INFO L226 Difference]: Without dead ends: 26 [2024-10-12 17:22:48,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-12 17:22:48,973 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:48,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 54 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 17:22:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-12 17:22:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2024-10-12 17:22:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 17:22:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2024-10-12 17:22:48,979 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2024-10-12 17:22:48,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:48,979 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2024-10-12 17:22:48,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-12 17:22:48,979 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2024-10-12 17:22:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 17:22:48,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:48,980 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:48,987 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-12 17:22:49,183 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-12 17:22:49,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:49,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1234767684, now seen corresponding path program 1 times [2024-10-12 17:22:49,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:49,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744480895] [2024-10-12 17:22:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:49,185 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-12 17:22:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:49,187 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-12 17:22:49,188 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-12 17:22:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:49,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:22:49,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 17:22:49,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:49,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744480895] [2024-10-12 17:22:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744480895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:49,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:22:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820492079] [2024-10-12 17:22:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:49,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:22:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:22:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:49,287 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:49,523 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-12 17:22:49,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:22:49,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-12 17:22:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:49,525 INFO L225 Difference]: With dead ends: 35 [2024-10-12 17:22:49,525 INFO L226 Difference]: Without dead ends: 27 [2024-10-12 17:22:49,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:49,526 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 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-12 17:22:49,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 17:22:49,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-12 17:22:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-12 17:22:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 17:22:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-10-12 17:22:49,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 21 [2024-10-12 17:22:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:49,532 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-10-12 17:22:49,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-10-12 17:22:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-12 17:22:49,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:49,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:49,539 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-12 17:22:49,736 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 [2024-10-12 17:22:49,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:49,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1232920642, now seen corresponding path program 1 times [2024-10-12 17:22:49,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:49,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184545330] [2024-10-12 17:22:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:49,738 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-12 17:22:49,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:49,741 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12 17:22:49,742 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 (8)] Waiting until timeout for monitored process [2024-10-12 17:22:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:49,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 17:22:49,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:49,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 17:22:49,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:49,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:49,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184545330] [2024-10-12 17:22:49,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184545330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:49,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 17:22:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992342756] [2024-10-12 17:22:49,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:49,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 17:22:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:49,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 17:22:49,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:49,868 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:49,923 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2024-10-12 17:22:49,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 17:22:49,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-12 17:22:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:49,925 INFO L225 Difference]: With dead ends: 32 [2024-10-12 17:22:49,925 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 17:22:49,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 17:22:49,926 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:49,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 17:22:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 17:22:49,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 17:22:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 17:22:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-12 17:22:49,931 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 21 [2024-10-12 17:22:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:49,932 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-12 17:22:49,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:49,932 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-12 17:22:49,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-12 17:22:49,932 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:49,933 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:49,939 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 (8)] Ended with exit code 0 [2024-10-12 17:22:50,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 17:22:50,134 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:50,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:50,134 INFO L85 PathProgramCache]: Analyzing trace with hash 527910856, now seen corresponding path program 1 times [2024-10-12 17:22:50,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:50,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298997136] [2024-10-12 17:22:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:50,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 17:22:50,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:50,137 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-12 17:22:50,138 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-12 17:22:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:50,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 17:22:50,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 17:22:50,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:50,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:50,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298997136] [2024-10-12 17:22:50,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298997136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:50,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:50,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 17:22:50,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101778321] [2024-10-12 17:22:50,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:50,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 17:22:50,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:50,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 17:22:50,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 17:22:50,357 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:50,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:50,562 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-10-12 17:22:50,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 17:22:50,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-12 17:22:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:50,563 INFO L225 Difference]: With dead ends: 42 [2024-10-12 17:22:50,563 INFO L226 Difference]: Without dead ends: 29 [2024-10-12 17:22:50,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-12 17:22:50,564 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:50,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 17:22:50,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-12 17:22:50,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-12 17:22:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 17:22:50,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-10-12 17:22:50,570 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-10-12 17:22:50,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:50,570 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-10-12 17:22:50,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-10-12 17:22:50,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 17:22:50,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:50,571 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:50,576 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 (9)] Ended with exit code 0 [2024-10-12 17:22:50,775 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-12 17:22:50,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:50,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:50,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2012644792, now seen corresponding path program 1 times [2024-10-12 17:22:50,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:50,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018780229] [2024-10-12 17:22:50,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:50,776 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-12 17:22:50,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:50,778 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-12 17:22:50,779 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-12 17:22:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:50,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 17:22:50,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 17:22:50,862 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:50,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:50,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018780229] [2024-10-12 17:22:50,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018780229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:50,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:50,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 17:22:50,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179871170] [2024-10-12 17:22:50,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:50,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 17:22:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:50,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 17:22:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:50,865 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:51,003 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-10-12 17:22:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 17:22:51,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-10-12 17:22:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:51,005 INFO L225 Difference]: With dead ends: 38 [2024-10-12 17:22:51,005 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 17:22:51,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 17:22:51,006 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 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.1s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:51,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 17:22:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 17:22:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2024-10-12 17:22:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 17:22:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-12 17:22:51,011 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 23 [2024-10-12 17:22:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-12 17:22:51,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-12 17:22:51,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 17:22:51,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:51,018 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:51,023 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 (10)] Ended with exit code 0 [2024-10-12 17:22:51,218 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-12 17:22:51,219 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:51,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash -823936700, now seen corresponding path program 1 times [2024-10-12 17:22:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231898778] [2024-10-12 17:22:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:51,220 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-12 17:22:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:51,222 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-12 17:22:51,224 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-12 17:22:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 17:22:51,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 17:22:51,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 17:22:51,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 17:22:51,440 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 17:22:51,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 17:22:51,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231898778] [2024-10-12 17:22:51,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231898778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 17:22:51,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 17:22:51,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 17:22:51,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126254624] [2024-10-12 17:22:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 17:22:51,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 17:22:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 17:22:51,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 17:22:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 17:22:51,442 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 17:22:51,802 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-10-12 17:22:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 17:22:51,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-10-12 17:22:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 17:22:51,804 INFO L225 Difference]: With dead ends: 35 [2024-10-12 17:22:51,804 INFO L226 Difference]: Without dead ends: 21 [2024-10-12 17:22:51,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-12 17:22:51,805 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 17:22:51,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 49 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 17:22:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-12 17:22:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-10-12 17:22:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 17:22:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-12 17:22:51,811 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 24 [2024-10-12 17:22:51,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 17:22:51,811 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-12 17:22:51,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 17:22:51,812 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-12 17:22:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 17:22:51,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 17:22:51,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:51,820 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-12 17:22:52,013 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-12 17:22:52,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 17:22:52,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 17:22:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 118740037, now seen corresponding path program 1 times [2024-10-12 17:22:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 17:22:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [45845895] [2024-10-12 17:22:52,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 17:22:52,014 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-12 17:22:52,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 17:22:52,017 INFO L229 MonitoredProcess]: Starting monitored process 12 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-12 17:22:52,018 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 (12)] Waiting until timeout for monitored process [2024-10-12 17:22:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:22:52,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 17:22:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 17:22:52,194 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-12 17:22:52,194 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 17:22:52,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 17:22:52,209 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 (12)] Ended with exit code 0 [2024-10-12 17:22:52,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-12 17:22:52,401 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 17:22:52,430 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 17:22:52,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 05:22:52 BoogieIcfgContainer [2024-10-12 17:22:52,433 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 17:22:52,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 17:22:52,434 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 17:22:52,434 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 17:22:52,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:22:45" (3/4) ... [2024-10-12 17:22:52,435 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 17:22:52,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 17:22:52,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 17:22:52,479 INFO L158 Benchmark]: Toolchain (without parser) took 7461.14ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 35.8MB in the beginning and 81.5MB in the end (delta: -45.7MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-12 17:22:52,479 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 73.4MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:52,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.47ms. Allocated memory is still 73.4MB. Free memory was 35.6MB in the beginning and 43.9MB in the end (delta: -8.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-10-12 17:22:52,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.75ms. Allocated memory is still 73.4MB. Free memory was 43.9MB in the beginning and 42.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 17:22:52,480 INFO L158 Benchmark]: Boogie Preprocessor took 70.56ms. Allocated memory is still 73.4MB. Free memory was 42.3MB in the beginning and 39.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 17:22:52,481 INFO L158 Benchmark]: RCFGBuilder took 452.10ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 39.8MB in the beginning and 107.4MB in the end (delta: -67.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 17:22:52,481 INFO L158 Benchmark]: TraceAbstraction took 6499.07ms. Allocated memory is still 136.3MB. Free memory was 106.9MB in the beginning and 83.6MB in the end (delta: 23.3MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-10-12 17:22:52,481 INFO L158 Benchmark]: Witness Printer took 44.70ms. Allocated memory is still 136.3MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 17:22:52,483 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.11ms. Allocated memory is still 73.4MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.47ms. Allocated memory is still 73.4MB. Free memory was 35.6MB in the beginning and 43.9MB in the end (delta: -8.3MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.75ms. Allocated memory is still 73.4MB. Free memory was 43.9MB in the beginning and 42.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 70.56ms. Allocated memory is still 73.4MB. Free memory was 42.3MB in the beginning and 39.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 452.10ms. Allocated memory was 73.4MB in the beginning and 136.3MB in the end (delta: 62.9MB). Free memory was 39.8MB in the beginning and 107.4MB in the end (delta: -67.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6499.07ms. Allocated memory is still 136.3MB. Free memory was 106.9MB in the beginning and 83.6MB in the end (delta: 23.3MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 44.70ms. Allocated memory is still 136.3MB. Free memory was 83.6MB in the beginning and 81.5MB in the end (delta: 2.1MB). 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 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L81] double x = 0.0; [L82] double y = -0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L37] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L54] RET, EXPR __fpclassify_double(x) VAL [x=0.0, y=0.0] [L54] COND FALSE !(__fpclassify_double(x) == 0) [L56] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L37] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L56] RET, EXPR __fpclassify_double(y) VAL [x=0.0, y=0.0] [L56] COND FALSE !(__fpclassify_double(y) == 0) [L59] return x > y ? x : y; VAL [\result=0.0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0.0] [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] CALL, EXPR __signbit_double(res) [L63] __uint32_t msw; VAL [x=0.0] [L66] ieee_double_shape_type gh_u; [L67] gh_u.value = (x) [L68] EXPR gh_u.parts.msw [L68] (msw) = gh_u.parts.msw [L71] return (msw & 0x80000000) != 0; [L86] RET, EXPR __signbit_double(res) [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 628 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 411 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 346 IncrementalHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 217 mSDtfsCounter, 346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 171 ConstructedInterpolants, 24 QuantifiedInterpolants, 745 SizeOfPredicates, 15 NumberOfNonLiveVariables, 640 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 30/30 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 proved your program to be incorrect! [2024-10-12 17:22:52,523 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE