./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.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 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:53:44,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:53:44,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 04:53:44,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:53:44,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:53:44,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:53:44,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:53:44,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:53:44,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:53:44,799 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:53:44,800 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:53:44,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:53:44,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:53:44,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:53:44,803 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:53:44,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:53:44,803 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:53:44,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:53:44,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 04:53:44,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:53:44,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:53:44,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:53:44,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:53:44,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:53:44,807 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:53:44,807 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:53:44,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:53:44,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:53:44,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:53:44,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:53:44,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:53:44,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:53:44,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:53:44,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:53:44,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:53:44,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:53:44,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 04:53:44,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 04:53:44,810 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:53:44,810 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:53:44,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:53:44,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:53:44,812 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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2024-11-16 04:53:45,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:53:45,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:53:45,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:53:45,041 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:53:45,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:53:45,044 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2024-11-16 04:53:46,307 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:53:46,457 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:53:46,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2024-11-16 04:53:46,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a707292c5/84f6752b917341b9b70f99e6b26d7788/FLAG6498b746f [2024-11-16 04:53:46,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a707292c5/84f6752b917341b9b70f99e6b26d7788 [2024-11-16 04:53:46,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:53:46,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:53:46,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:53:46,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:53:46,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:53:46,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ae9981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46, skipping insertion in model container [2024-11-16 04:53:46,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:53:46,614 WARN L250 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-16 04:53:46,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:53:46,626 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:53:46,641 WARN L250 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-16 04:53:46,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:53:46,653 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:53:46,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46 WrapperNode [2024-11-16 04:53:46,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:53:46,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:53:46,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:53:46,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:53:46,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,677 INFO L138 Inliner]: procedures = 18, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 101 [2024-11-16 04:53:46,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:53:46,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:53:46,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:53:46,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:53:46,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,694 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2024-11-16 04:53:46,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:53:46,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:53:46,703 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:53:46,703 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:53:46,704 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (1/1) ... [2024-11-16 04:53:46,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:53:46,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:53:46,802 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-11-16 04:53:46,805 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-11-16 04:53:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:53:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 04:53:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 04:53:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 04:53:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 04:53:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 04:53:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 04:53:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 04:53:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:53:46,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:53:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 04:53:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 04:53:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 04:53:46,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 04:53:46,892 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:53:46,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:53:47,040 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__min~0#1.base, main_~#main__min~0#1.offset);havoc main_~#main__min~0#1.base, main_~#main__min~0#1.offset;call ULTIMATE.dealloc(main_~#main__max~0#1.base, main_~#main__max~0#1.offset);havoc main_~#main__max~0#1.base, main_~#main__max~0#1.offset; [2024-11-16 04:53:47,051 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-16 04:53:47,051 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:53:47,066 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:53:47,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:53:47,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:53:47 BoogieIcfgContainer [2024-11-16 04:53:47,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:53:47,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:53:47,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:53:47,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:53:47,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:53:46" (1/3) ... [2024-11-16 04:53:47,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77191ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:53:47, skipping insertion in model container [2024-11-16 04:53:47,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:46" (2/3) ... [2024-11-16 04:53:47,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77191ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:53:47, skipping insertion in model container [2024-11-16 04:53:47,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:53:47" (3/3) ... [2024-11-16 04:53:47,077 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2024-11-16 04:53:47,091 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:53:47,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 04:53:47,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:53:47,143 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;@5a92d787, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:53:47,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 04:53:47,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 04:53:47,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:53:47,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:53:47,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:53:47,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:53:47,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1073478575, now seen corresponding path program 1 times [2024-11-16 04:53:47,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:53:47,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606079712] [2024-11-16 04:53:47,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:53:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:53:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:53:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:53:47,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:53:47,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606079712] [2024-11-16 04:53:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606079712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:53:47,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:53:47,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 04:53:47,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451646836] [2024-11-16 04:53:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:53:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 04:53:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:53:47,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 04:53:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 04:53:47,447 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:53:47,478 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-16 04:53:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 04:53:47,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-16 04:53:47,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:53:47,485 INFO L225 Difference]: With dead ends: 31 [2024-11-16 04:53:47,486 INFO L226 Difference]: Without dead ends: 20 [2024-11-16 04:53:47,488 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-11-16 04:53:47,490 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 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, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:53:47,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:53:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-16 04:53:47,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-16 04:53:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-16 04:53:47,513 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2024-11-16 04:53:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:53:47,513 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-16 04:53:47,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-16 04:53:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 04:53:47,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:53:47,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:53:47,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 04:53:47,515 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:53:47,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:53:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1072495472, now seen corresponding path program 1 times [2024-11-16 04:53:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:53:47,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528491755] [2024-11-16 04:53:47,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:53:47,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:53:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:53:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:53:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 04:53:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528491755] [2024-11-16 04:53:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528491755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:53:47,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:53:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:53:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513346110] [2024-11-16 04:53:47,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:53:47,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:53:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 04:53:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:53:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:53:47,587 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:53:47,596 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-16 04:53:47,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:53:47,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-16 04:53:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:53:47,597 INFO L225 Difference]: With dead ends: 37 [2024-11-16 04:53:47,597 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 04:53:47,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-16 04:53:47,599 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 04:53:47,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:53:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 04:53:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2024-11-16 04:53:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:47,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-16 04:53:47,602 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2024-11-16 04:53:47,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:53:47,602 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-16 04:53:47,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:47,603 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-16 04:53:47,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 04:53:47,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:53:47,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:53:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 04:53:47,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:53:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:53:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1424695433, now seen corresponding path program 1 times [2024-11-16 04:53:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 04:53:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304391416] [2024-11-16 04:53:47,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:53:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 04:53:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 04:53:47,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 04:53:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 04:53:47,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 04:53:47,646 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 04:53:47,647 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 04:53:47,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 04:53:47,651 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-16 04:53:47,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 04:53:47,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:53:47 BoogieIcfgContainer [2024-11-16 04:53:47,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 04:53:47,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 04:53:47,675 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 04:53:47,675 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 04:53:47,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:53:47" (3/4) ... [2024-11-16 04:53:47,677 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 04:53:47,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 04:53:47,679 INFO L158 Benchmark]: Toolchain (without parser) took 1202.90ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 95.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-11-16 04:53:47,679 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:53:47,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.80ms. Allocated memory is still 176.2MB. Free memory was 106.5MB in the beginning and 93.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 04:53:47,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.79ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 04:53:47,680 INFO L158 Benchmark]: Boogie Preprocessor took 24.54ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 04:53:47,680 INFO L158 Benchmark]: IcfgBuilder took 364.13ms. Allocated memory is still 176.2MB. Free memory was 89.9MB in the beginning and 137.5MB in the end (delta: -47.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 04:53:47,680 INFO L158 Benchmark]: TraceAbstraction took 604.44ms. Allocated memory is still 176.2MB. Free memory was 136.9MB in the beginning and 96.3MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-16 04:53:47,681 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 176.2MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 04:53:47,682 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.80ms. Allocated memory is still 176.2MB. Free memory was 106.5MB in the beginning and 93.7MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.79ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.54ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 89.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 364.13ms. Allocated memory is still 176.2MB. Free memory was 89.9MB in the beginning and 137.5MB in the end (delta: -47.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 604.44ms. Allocated memory is still 176.2MB. Free memory was 136.9MB in the beginning and 96.3MB in the end (delta: 40.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 176.2MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 51]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L14] int main__i; [L15] float main__z; [L16] float main__t; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L17] float main__min[5] = { 5, 10, 12, 30, 150 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L18] float main__max[5] = { 10, 12, 30, 150, 300 }; [L19] main__t = __VERIFIER_nondet_float() [L20] int main____CPAchecker_TMP_0; [L21] EXPR main__min[0] VAL [__return_main=0] [L21] COND TRUE main__t >= (main__min[0]) [L23] EXPR main__max[4UL] VAL [__return_main=0] [L23] COND TRUE main__t <= (main__max[4UL]) [L25] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_main=0, main__i=0, main__max={4:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_main=0] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_main=0, main__i=0, main__max={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_main=0, main__i=0, main__max={4:0}] [L63] main____CPAchecker_TMP_1 = 0 VAL [__return_main=0, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0, main__max={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0, main__max={4:0}] [L51] reach_error() VAL [__return_main=0, main__i=0, main__max={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 44 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-11-16 04:53:47,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.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 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 04:53:49,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 04:53:49,763 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 04:53:49,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 04:53:49,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 04:53:49,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 04:53:49,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 04:53:49,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 04:53:49,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 04:53:49,794 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 04:53:49,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 04:53:49,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 04:53:49,795 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 04:53:49,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 04:53:49,796 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 04:53:49,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 04:53:49,796 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 04:53:49,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 04:53:49,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 04:53:49,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 04:53:49,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 04:53:49,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 04:53:49,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 04:53:49,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 04:53:49,798 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 04:53:49,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 04:53:49,798 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 04:53:49,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 04:53:49,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 04:53:49,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 04:53:49,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 04:53:49,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 04:53:49,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 04:53:49,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 04:53:49,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:53:49,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 04:53:49,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 04:53:49,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 04:53:49,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 04:53:49,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 04:53:49,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 04:53:49,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 04:53:49,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 04:53:49,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 04:53:49,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 -> 198a885d453136e0f485e10bae010eb2ed68236b2d57919bf162df9bdad27ee6 [2024-11-16 04:53:50,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 04:53:50,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 04:53:50,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 04:53:50,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 04:53:50,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 04:53:50,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2024-11-16 04:53:51,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 04:53:51,662 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 04:53:51,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.p+cfa-reducer.c [2024-11-16 04:53:51,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535f50b2f/6b0cf6d5a1b443789c05ed8c6583111e/FLAG115e3f64a [2024-11-16 04:53:51,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/535f50b2f/6b0cf6d5a1b443789c05ed8c6583111e [2024-11-16 04:53:51,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 04:53:51,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 04:53:51,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 04:53:51,697 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 04:53:51,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 04:53:51,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:51,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd6d818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51, skipping insertion in model container [2024-11-16 04:53:51,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:51,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 04:53:51,877 WARN L250 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-16 04:53:51,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:53:51,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 04:53:51,920 WARN L250 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-benchs/interpolation.c.p+cfa-reducer.c[1306,1319] [2024-11-16 04:53:51,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 04:53:51,940 INFO L204 MainTranslator]: Completed translation [2024-11-16 04:53:51,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51 WrapperNode [2024-11-16 04:53:51,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 04:53:51,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 04:53:51,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 04:53:51,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 04:53:51,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:51,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:51,983 INFO L138 Inliner]: procedures = 19, calls = 33, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 102 [2024-11-16 04:53:51,983 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 04:53:51,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 04:53:51,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 04:53:51,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 04:53:51,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:51,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:51,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,012 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 8, 8]. 44 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 0 writes are split as follows [0, 0, 0]. [2024-11-16 04:53:52,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 04:53:52,038 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 04:53:52,040 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 04:53:52,040 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 04:53:52,041 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (1/1) ... [2024-11-16 04:53:52,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 04:53:52,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 04:53:52,074 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-11-16 04:53:52,081 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-11-16 04:53:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 04:53:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-16 04:53:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-16 04:53:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-16 04:53:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 04:53:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 04:53:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 04:53:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 04:53:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 04:53:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 04:53:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-16 04:53:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 04:53:52,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 04:53:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 04:53:52,204 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 04:53:52,205 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 04:53:52,810 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;call ULTIMATE.dealloc(main_~#main__min~0#1.base, main_~#main__min~0#1.offset);havoc main_~#main__min~0#1.base, main_~#main__min~0#1.offset;call ULTIMATE.dealloc(main_~#main__max~0#1.base, main_~#main__max~0#1.offset);havoc main_~#main__max~0#1.base, main_~#main__max~0#1.offset; [2024-11-16 04:53:52,816 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-16 04:53:52,816 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 04:53:52,824 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 04:53:52,825 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 04:53:52,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:53:52 BoogieIcfgContainer [2024-11-16 04:53:52,825 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 04:53:52,827 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 04:53:52,827 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 04:53:52,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 04:53:52,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:53:51" (1/3) ... [2024-11-16 04:53:52,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263459c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:53:52, skipping insertion in model container [2024-11-16 04:53:52,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:53:51" (2/3) ... [2024-11-16 04:53:52,830 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263459c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:53:52, skipping insertion in model container [2024-11-16 04:53:52,830 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:53:52" (3/3) ... [2024-11-16 04:53:52,832 INFO L112 eAbstractionObserver]: Analyzing ICFG interpolation.c.p+cfa-reducer.c [2024-11-16 04:53:52,856 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 04:53:52,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 04:53:52,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 04:53:52,901 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;@6169a183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 04:53:52,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 04:53:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:52,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 04:53:52,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:53:52,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:53:52,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:53:52,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:53:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1073478575, now seen corresponding path program 1 times [2024-11-16 04:53:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:53:52,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745955350] [2024-11-16 04:53:52,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:53:52,927 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-11-16 04:53:52,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:53:52,931 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-11-16 04:53:52,935 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-11-16 04:53:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:53:53,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 04:53:53,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:53:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:53:53,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:53:53,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:53:53,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745955350] [2024-11-16 04:53:53,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745955350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:53:53,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:53:53,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:53:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446974539] [2024-11-16 04:53:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:53:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:53:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:53:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:53:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:53:53,322 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:54,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 04:53:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:53:54,780 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2024-11-16 04:53:54,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:53:54,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-16 04:53:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:53:54,794 INFO L225 Difference]: With dead ends: 37 [2024-11-16 04:53:54,795 INFO L226 Difference]: Without dead ends: 22 [2024-11-16 04:53:54,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-11-16 04:53:54,801 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 04:53:54,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 44 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 04:53:54,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-16 04:53:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-16 04:53:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-16 04:53:54,823 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 14 [2024-11-16 04:53:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:53:54,824 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-16 04:53:54,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:54,824 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-16 04:53:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 04:53:54,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:53:54,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:53:54,836 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-11-16 04:53:55,025 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-11-16 04:53:55,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:53:55,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:53:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1425678536, now seen corresponding path program 1 times [2024-11-16 04:53:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:53:55,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400314980] [2024-11-16 04:53:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:53:55,028 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-11-16 04:53:55,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:53:55,060 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-11-16 04:53:55,064 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-11-16 04:53:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:53:55,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 04:53:55,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:53:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:53:55,351 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:53:55,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:53:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400314980] [2024-11-16 04:53:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400314980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:53:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:53:55,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 04:53:55,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188363456] [2024-11-16 04:53:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:53:55,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 04:53:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:53:55,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 04:53:55,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 04:53:55,354 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:57,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 04:53:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:53:57,537 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-16 04:53:57,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 04:53:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 04:53:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:53:57,541 INFO L225 Difference]: With dead ends: 24 [2024-11-16 04:53:57,541 INFO L226 Difference]: Without dead ends: 20 [2024-11-16 04:53:57,541 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-11-16 04:53:57,542 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 04:53:57,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 04:53:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-16 04:53:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-16 04:53:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-16 04:53:57,555 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 15 [2024-11-16 04:53:57,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:53:57,556 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-16 04:53:57,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:53:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-16 04:53:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 04:53:57,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:53:57,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:53:57,568 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-11-16 04:53:57,759 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-11-16 04:53:57,759 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:53:57,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:53:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1424695433, now seen corresponding path program 1 times [2024-11-16 04:53:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:53:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497487796] [2024-11-16 04:53:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:53:57,762 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-11-16 04:53:57,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:53:57,763 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-11-16 04:53:57,765 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-11-16 04:53:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:53:58,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 04:53:58,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:53:59,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 04:53:59,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2024-11-16 04:53:59,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2024-11-16 04:54:31,252 WARN L286 SmtUtils]: Spent 12.93s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-16 04:54:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:54:35,062 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:54:35,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:54:35,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497487796] [2024-11-16 04:54:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497487796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:54:35,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:54:35,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 04:54:35,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189267846] [2024-11-16 04:54:35,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:54:35,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 04:54:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:54:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 04:54:35,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 04:54:35,064 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:54:38,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:54:39,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:54:42,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:54:43,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:54:45,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:54:47,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:54:49,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 04:54:51,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 04:54:55,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:54:58,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:55:02,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:55:05,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 04:55:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:55:06,160 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2024-11-16 04:55:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 04:55:06,163 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 04:55:06,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:55:06,164 INFO L225 Difference]: With dead ends: 37 [2024-11-16 04:55:06,164 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 04:55:06,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 04:55:06,165 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2024-11-16 04:55:06,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 56 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 1 Unknown, 0 Unchecked, 31.1s Time] [2024-11-16 04:55:06,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 04:55:06,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-11-16 04:55:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-16 04:55:06,169 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2024-11-16 04:55:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:55:06,169 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-16 04:55:06,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-16 04:55:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 04:55:06,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:55:06,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:55:06,182 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-11-16 04:55:06,374 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-11-16 04:55:06,375 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:55:06,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:55:06,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1753336009, now seen corresponding path program 1 times [2024-11-16 04:55:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:55:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138438901] [2024-11-16 04:55:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:55:06,376 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-11-16 04:55:06,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:55:06,385 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-11-16 04:55:06,386 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-11-16 04:55:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:55:06,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 04:55:06,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:55:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:55:06,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 04:55:06,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:55:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138438901] [2024-11-16 04:55:06,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138438901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 04:55:06,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 04:55:06,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 04:55:06,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645408302] [2024-11-16 04:55:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 04:55:06,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 04:55:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:55:06,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 04:55:06,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 04:55:06,670 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:06,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:55:06,700 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-16 04:55:06,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 04:55:06,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 04:55:06,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:55:06,701 INFO L225 Difference]: With dead ends: 36 [2024-11-16 04:55:06,701 INFO L226 Difference]: Without dead ends: 20 [2024-11-16 04:55:06,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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-11-16 04:55:06,702 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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-11-16 04:55:06,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 04:55:06,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-16 04:55:06,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-16 04:55:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2024-11-16 04:55:06,704 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 15 [2024-11-16 04:55:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:55:06,705 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2024-11-16 04:55:06,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2024-11-16 04:55:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 04:55:06,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:55:06,706 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:55:06,715 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-11-16 04:55:06,906 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-11-16 04:55:06,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:55:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:55:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash -354457128, now seen corresponding path program 1 times [2024-11-16 04:55:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:55:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258888871] [2024-11-16 04:55:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:55:06,908 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-11-16 04:55:06,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:55:06,909 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-11-16 04:55:06,910 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-11-16 04:55:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:55:07,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 04:55:07,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:55:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:55:07,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 04:55:07,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 04:55:07,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 04:55:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258888871] [2024-11-16 04:55:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258888871] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 04:55:07,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 04:55:07,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-16 04:55:07,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794879348] [2024-11-16 04:55:07,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 04:55:07,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 04:55:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 04:55:07,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 04:55:07,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 04:55:07,536 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:11,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 04:55:11,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 04:55:11,483 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-11-16 04:55:11,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 04:55:11,484 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-16 04:55:11,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 04:55:11,485 INFO L225 Difference]: With dead ends: 39 [2024-11-16 04:55:11,485 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 04:55:11,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-16 04:55:11,486 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-16 04:55:11,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-16 04:55:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 04:55:11,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2024-11-16 04:55:11,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:11,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-16 04:55:11,490 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2024-11-16 04:55:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 04:55:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-16 04:55:11,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 04:55:11,490 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-16 04:55:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 04:55:11,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 04:55:11,491 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 04:55:11,505 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 (6)] Ended with exit code 0 [2024-11-16 04:55:11,691 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-11-16 04:55:11,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 04:55:11,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 04:55:11,693 INFO L85 PathProgramCache]: Analyzing trace with hash -640343249, now seen corresponding path program 1 times [2024-11-16 04:55:11,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 04:55:11,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654428139] [2024-11-16 04:55:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 04:55:11,697 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-11-16 04:55:11,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 04:55:11,699 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-11-16 04:55:11,708 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-11-16 04:55:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 04:55:11,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 04:55:11,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 04:55:15,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 04:55:15,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 179 treesize of output 107 [2024-11-16 04:55:15,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 04:55:15,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 53