./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/filter1.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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:26:51,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:26:51,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:26:51,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:26:51,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:26:51,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:26:51,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:26:51,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:26:51,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:26:51,503 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:26:51,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:26:51,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:26:51,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:26:51,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:26:51,507 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:26:51,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:26:51,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:26:51,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:26:51,508 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:26:51,508 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:26:51,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:26:51,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:26:51,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:26:51,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:26:51,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:26:51,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:26:51,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:26:51,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:26:51,512 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:26:51,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:26:51,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:26:51,512 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:26:51,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:26:51,513 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:26:51,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:26:51,513 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:26:51,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:26:51,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:26:51,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:26:51,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:26:51,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:26:51,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:26:51,515 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2024-11-09 20:26:51,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:26:51,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:26:51,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:26:51,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:26:51,748 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:26:51,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-09 20:26:52,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:26:53,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:26:53,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-09 20:26:53,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b7612ac/f86aef2fa51f40bf9091fff96091a95b/FLAG0d7201c1c [2024-11-09 20:26:53,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b7612ac/f86aef2fa51f40bf9091fff96091a95b [2024-11-09 20:26:53,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:26:53,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:26:53,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:26:53,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:26:53,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:26:53,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e592bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53, skipping insertion in model container [2024-11-09 20:26:53,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,207 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:26:53,390 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/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-09 20:26:53,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:26:53,405 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:26:53,416 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/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-09 20:26:53,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:26:53,436 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:26:53,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53 WrapperNode [2024-11-09 20:26:53,436 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:26:53,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:26:53,437 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:26:53,437 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:26:53,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,466 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-11-09 20:26:53,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:26:53,467 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:26:53,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:26:53,467 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:26:53,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,484 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:26:53,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,489 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,490 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:26:53,492 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:26:53,492 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:26:53,493 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:26:53,493 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (1/1) ... [2024-11-09 20:26:53,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:26:53,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:26:53,526 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-09 20:26:53,531 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-09 20:26:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:26:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:26:53,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:26:53,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:26:53,627 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:26:53,629 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:26:53,769 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:26:53,770 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:26:53,770 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:26:53,770 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:26:53,770 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:26:53,776 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 20:26:53,777 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:26:53,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:26:53,787 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:26:53,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:26:53 BoogieIcfgContainer [2024-11-09 20:26:53,788 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:26:53,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:26:53,790 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:26:53,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:26:53,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:26:53" (1/3) ... [2024-11-09 20:26:53,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29dd1bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:26:53, skipping insertion in model container [2024-11-09 20:26:53,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:53" (2/3) ... [2024-11-09 20:26:53,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29dd1bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:26:53, skipping insertion in model container [2024-11-09 20:26:53,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:26:53" (3/3) ... [2024-11-09 20:26:53,796 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2024-11-09 20:26:53,811 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:26:53,812 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:26:53,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:26:53,868 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;@24fd41de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:26:53,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:26:53,872 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-09 20:26:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:26:53,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:53,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:53,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:26:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1322778403, now seen corresponding path program 1 times [2024-11-09 20:26:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:26:53,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957244482] [2024-11-09 20:26:53,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:53,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:26:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:26:54,092 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-09 20:26:54,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:26:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957244482] [2024-11-09 20:26:54,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957244482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:26:54,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:26:54,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:26:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399837721] [2024-11-09 20:26:54,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:26:54,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:26:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:26:54,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:26:54,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:26:54,121 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 3.0) internal successors, (15), 5 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-09 20:26:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:26:54,159 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-09 20:26:54,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:26:54,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-09 20:26:54,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:26:54,171 INFO L225 Difference]: With dead ends: 31 [2024-11-09 20:26:54,171 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 20:26:54,174 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-09 20:26:54,176 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:26:54,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:26:54,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 20:26:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2024-11-09 20:26:54,199 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-09 20:26:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-09 20:26:54,201 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-11-09 20:26:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:26:54,201 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 20:26:54,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 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-09 20:26:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-09 20:26:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:26:54,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:26:54,202 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:26:54,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:26:54,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:26:54,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:26:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1321795300, now seen corresponding path program 1 times [2024-11-09 20:26:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:26:54,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312000232] [2024-11-09 20:26:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:26:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:26:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:26:54,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 20:26:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:26:54,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 20:26:54,291 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 20:26:54,293 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 20:26:54,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:26:54,302 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 20:26:54,317 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:26:54,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:26:54 BoogieIcfgContainer [2024-11-09 20:26:54,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:26:54,319 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:26:54,319 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:26:54,320 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:26:54,320 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:26:53" (3/4) ... [2024-11-09 20:26:54,322 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 20:26:54,323 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:26:54,325 INFO L158 Benchmark]: Toolchain (without parser) took 1139.03ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 62.9MB in the beginning and 152.9MB in the end (delta: -90.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:26:54,325 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:26:54,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.55ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 62.7MB in the beginning and 151.8MB in the end (delta: -89.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-09 20:26:54,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.18ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 149.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:26:54,328 INFO L158 Benchmark]: Boogie Preprocessor took 23.79ms. Allocated memory is still 186.6MB. Free memory was 149.7MB in the beginning and 148.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:26:54,329 INFO L158 Benchmark]: IcfgBuilder took 296.24ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 137.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 20:26:54,329 INFO L158 Benchmark]: TraceAbstraction took 528.86ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 152.9MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:26:54,330 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 186.6MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:26:54,332 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.16ms. Allocated memory is still 134.2MB. Free memory is still 86.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.55ms. Allocated memory was 134.2MB in the beginning and 186.6MB in the end (delta: 52.4MB). Free memory was 62.7MB in the beginning and 151.8MB in the end (delta: -89.1MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.18ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 149.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.79ms. Allocated memory is still 186.6MB. Free memory was 149.7MB in the beginning and 148.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 296.24ms. Allocated memory is still 186.6MB. Free memory was 148.7MB in the beginning and 137.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 528.86ms. Allocated memory is still 186.6MB. Free memory was 136.1MB in the beginning and 152.9MB in the end (delta: -16.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 186.6MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 56]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 43, overapproximation of to_real at line 39. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L15] double main__E0; [L16] double main__E1; [L17] double main__S; [L18] int main__i; [L19] main__E1 = 0 [L20] main__S = 0 [L21] main__i = 0 VAL [__return_main=0, main__i=0] [L23] COND TRUE main__i <= 1000000 [L25] main__E0 = __VERIFIER_nondet_double() [L26] int main____CPAchecker_TMP_0; VAL [__return_main=0, main__i=0] [L27] COND TRUE main__E0 >= -1.0 VAL [__return_main=0, main__i=0] [L29] COND TRUE main__E0 <= 1.0 [L31] main____CPAchecker_TMP_0 = 1 VAL [__return_main=0, main____CPAchecker_TMP_0=1, main__i=0] [L33] COND TRUE main____CPAchecker_TMP_0 != 0 [L35] int main____CPAchecker_TMP_1; [L36] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L37] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L39] main__S = 0 VAL [__return_main=0, main__i=0] [L41] main__E1 = main__E0 [L42] int main____CPAchecker_TMP_2; VAL [__return_main=0, main__i=0] [L43] COND FALSE !(main__S >= -10000.0) VAL [__return_main=0, main__i=0] [L69] main____CPAchecker_TMP_2 = 0 VAL [__return_main=0, main____CPAchecker_TMP_2=0, main__i=0] [L50] int __tmp_1; [L51] __tmp_1 = main____CPAchecker_TMP_2 [L52] int __VERIFIER_assert__cond; [L53] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_main=0, main__i=0] [L54] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, main__i=0] [L56] reach_error() VAL [__return_main=0, main__i=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 24 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 24 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-09 20:26:54,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/filter1.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 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:26:56,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:26:56,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 20:26:56,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:26:56,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:26:56,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:26:56,389 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:26:56,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:26:56,390 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:26:56,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:26:56,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:26:56,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:26:56,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:26:56,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:26:56,392 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:26:56,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:26:56,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:26:56,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:26:56,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:26:56,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:26:56,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:26:56,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:26:56,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:26:56,396 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 20:26:56,397 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 20:26:56,397 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:26:56,397 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 20:26:56,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:26:56,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:26:56,398 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:26:56,398 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:26:56,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:26:56,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:26:56,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:26:56,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:26:56,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:26:56,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:26:56,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:26:56,399 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 20:26:56,400 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 20:26:56,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:26:56,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:26:56,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:26:56,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:26:56,401 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 -> 6403ea17225d9927b82c2cb5a5e13cab8e302736934880873dcec33bef71c423 [2024-11-09 20:26:56,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:26:56,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:26:56,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:26:56,687 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:26:56,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:26:56,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-09 20:26:57,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:26:58,196 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:26:58,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.p+cfa-reducer.c [2024-11-09 20:26:58,208 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05592b287/3c312854f7cb474d9211d780108df9a9/FLAGafa1dfc73 [2024-11-09 20:26:58,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05592b287/3c312854f7cb474d9211d780108df9a9 [2024-11-09 20:26:58,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:26:58,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:26:58,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:26:58,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:26:58,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:26:58,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634f3527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58, skipping insertion in model container [2024-11-09 20:26:58,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:26:58,410 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/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-09 20:26:58,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:26:58,434 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:26:58,447 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/filter1.c.p+cfa-reducer.c[1310,1323] [2024-11-09 20:26:58,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:26:58,478 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:26:58,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58 WrapperNode [2024-11-09 20:26:58,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:26:58,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:26:58,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:26:58,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:26:58,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,511 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2024-11-09 20:26:58,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:26:58,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:26:58,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:26:58,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:26:58,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,537 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:26:58,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,538 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:26:58,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:26:58,557 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:26:58,557 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:26:58,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (1/1) ... [2024-11-09 20:26:58,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:26:58,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:26:58,627 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-09 20:26:58,631 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-09 20:26:58,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:26:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 20:26:58,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:26:58,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:26:58,726 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:26:58,728 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:27:02,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:27:02,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:27:02,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L34: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:27:02,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:27:02,990 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:27:02,996 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 20:27:02,996 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:27:03,008 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:27:03,008 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:27:03,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:27:03 BoogieIcfgContainer [2024-11-09 20:27:03,009 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:27:03,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:27:03,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:27:03,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:27:03,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:26:58" (1/3) ... [2024-11-09 20:27:03,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@993b621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:27:03, skipping insertion in model container [2024-11-09 20:27:03,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:26:58" (2/3) ... [2024-11-09 20:27:03,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@993b621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:27:03, skipping insertion in model container [2024-11-09 20:27:03,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:27:03" (3/3) ... [2024-11-09 20:27:03,016 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.p+cfa-reducer.c [2024-11-09 20:27:03,029 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:27:03,029 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 20:27:03,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:27:03,090 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;@3a0ce49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:27:03,090 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 20:27:03,094 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-09 20:27:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:27:03,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:27:03,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:27:03,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:27:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:27:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1322778403, now seen corresponding path program 1 times [2024-11-09 20:27:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:27:03,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217640151] [2024-11-09 20:27:03,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:27:03,118 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-09 20:27:03,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:27:03,120 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-09 20:27:03,121 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-09 20:27:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:27:03,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 20:27:03,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:27:03,289 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-09 20:27:03,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:27:03,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:27:03,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217640151] [2024-11-09 20:27:03,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217640151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:27:03,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:27:03,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 20:27:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714324953] [2024-11-09 20:27:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:27:03,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:27:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:27:03,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:27:03,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:27:03,313 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 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-09 20:27:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:27:03,399 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2024-11-09 20:27:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:27:03,402 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-09 20:27:03,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:27:03,407 INFO L225 Difference]: With dead ends: 29 [2024-11-09 20:27:03,407 INFO L226 Difference]: Without dead ends: 20 [2024-11-09 20:27:03,409 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-09 20:27:03,412 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:27:03,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 20:27:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-09 20:27:03,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-09 20:27:03,432 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-09 20:27:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2024-11-09 20:27:03,433 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 15 [2024-11-09 20:27:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:27:03,434 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2024-11-09 20:27:03,434 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-09 20:27:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2024-11-09 20:27:03,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:27:03,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:27:03,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:27:03,439 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 20:27:03,637 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-09 20:27:03,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:27:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:27:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1321795300, now seen corresponding path program 1 times [2024-11-09 20:27:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:27:03,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237779287] [2024-11-09 20:27:03,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:27:03,639 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-09 20:27:03,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:27:03,641 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-09 20:27:03,642 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-09 20:27:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:27:03,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:27:03,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:27:03,749 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-09 20:27:03,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:27:03,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:27:03,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237779287] [2024-11-09 20:27:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237779287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:27:03,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:27:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:27:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446515903] [2024-11-09 20:27:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:27:03,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:27:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:27:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:27:03,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:27:03,752 INFO L87 Difference]: Start difference. First operand 20 states and 25 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-09 20:27:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:27:04,525 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-11-09 20:27:04,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:27:04,526 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-09 20:27:04,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:27:04,530 INFO L225 Difference]: With dead ends: 51 [2024-11-09 20:27:04,530 INFO L226 Difference]: Without dead ends: 33 [2024-11-09 20:27:04,531 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-09 20:27:04,531 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 20:27:04,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 20:27:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-09 20:27:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2024-11-09 20:27:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 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-09 20:27:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-09 20:27:04,535 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2024-11-09 20:27:04,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:27:04,535 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-09 20:27:04,535 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-09 20:27:04,535 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-09 20:27:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:27:04,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:27:04,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:27:04,540 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-09 20:27:04,736 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-09 20:27:04,737 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:27:04,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:27:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash 453212062, now seen corresponding path program 1 times [2024-11-09 20:27:04,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:27:04,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217570676] [2024-11-09 20:27:04,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:27:04,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:27:04,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:27:04,741 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-09 20:27:04,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 20:27:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:27:05,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 20:27:05,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:27:06,002 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-09 20:27:06,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:27:06,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:27:06,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217570676] [2024-11-09 20:27:06,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217570676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:27:06,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:27:06,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:27:06,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923428776] [2024-11-09 20:27:06,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:27:06,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 20:27:06,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:27:06,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 20:27:06,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:27:06,004 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-09 20:27:08,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:27:08,215 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-09 20:27:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:27:08,234 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-09 20:27:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:27:08,236 INFO L225 Difference]: With dead ends: 75 [2024-11-09 20:27:08,236 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 20:27:08,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:27:08,237 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:27:08,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 45 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 20:27:08,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 20:27:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 30. [2024-11-09 20:27:08,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-09 20:27:08,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-09 20:27:08,242 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-09 20:27:08,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:27:08,243 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-09 20:27:08,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 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-09 20:27:08,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-09 20:27:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 20:27:08,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:27:08,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:27:08,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 20:27:08,444 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-09 20:27:08,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:27:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:27:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1736766307, now seen corresponding path program 1 times [2024-11-09 20:27:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:27:08,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457273195] [2024-11-09 20:27:08,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:27:08,446 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-09 20:27:08,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:27:08,448 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-09 20:27:08,454 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-09 20:27:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:27:08,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 20:27:08,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:27:08,751 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-09 20:27:08,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:27:08,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:27:08,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457273195] [2024-11-09 20:27:08,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457273195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:27:08,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:27:08,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:27:08,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774787463] [2024-11-09 20:27:08,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:27:08,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:27:08,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:27:08,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:27:08,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:27:08,754 INFO L87 Difference]: Start difference. First operand 30 states and 38 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-09 20:27:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:27:08,787 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-09 20:27:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:27:08,788 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-09 20:27:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:27:08,788 INFO L225 Difference]: With dead ends: 53 [2024-11-09 20:27:08,788 INFO L226 Difference]: Without dead ends: 29 [2024-11-09 20:27:08,788 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-09 20:27:08,793 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:27:08,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:27:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-09 20:27:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-09 20:27:08,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-09 20:27:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-11-09 20:27:08,795 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2024-11-09 20:27:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:27:08,795 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-11-09 20:27:08,795 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-09 20:27:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-11-09 20:27:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 20:27:08,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:27:08,796 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:27:08,806 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-09 20:27:08,997 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-09 20:27:08,997 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:27:08,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:27:08,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1645208756, now seen corresponding path program 1 times [2024-11-09 20:27:08,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:27:08,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548127418] [2024-11-09 20:27:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:27:08,998 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-09 20:27:08,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:27:08,999 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-09 20:27:09,001 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-09 20:27:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:27:09,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 20:27:09,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:27:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:27:27,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 20:27:36,946 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 20:27:40,987 WARN L851 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2024-11-09 20:27:45,027 WARN L873 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2024-11-09 20:27:53,107 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 20:28:01,192 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 20:28:09,323 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 20:28:17,403 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)