./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:58:42,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:58:42,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:58:42,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:58:42,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:58:42,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:58:42,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:58:42,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:58:42,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:58:42,264 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:58:42,264 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:58:42,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:58:42,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:58:42,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:58:42,266 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:58:42,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:58:42,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:58:42,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:58:42,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:58:42,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:58:42,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:58:42,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:58:42,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:58:42,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:58:42,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:58:42,272 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:58:42,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:58:42,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:58:42,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:58:42,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:58:42,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:58:42,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:58:42,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:58:42,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:58:42,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:58:42,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:58:42,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:58:42,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:58:42,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:58:42,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:58:42,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:58:42,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:58:42,278 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:58:42,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:58:42,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:58:42,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:58:42,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:58:42,624 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:58:42,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-09-25 10:58:44,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:58:44,244 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:58:44,244 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-09-25 10:58:44,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/f67d5671e/6b402c67875843bf95f59c0ca68c1729/FLAG3630206f5 [2024-09-25 10:58:44,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/f67d5671e/6b402c67875843bf95f59c0ca68c1729 [2024-09-25 10:58:44,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:58:44,264 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:58:44,265 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:58:44,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:58:44,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:58:44,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6d6391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44, skipping insertion in model container [2024-09-25 10:58:44,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:58:44,454 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-09-25 10:58:44,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:58:44,485 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:58:44,496 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-09-25 10:58:44,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:58:44,524 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:58:44,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44 WrapperNode [2024-09-25 10:58:44,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:58:44,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:58:44,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:58:44,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:58:44,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,549 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:58:44,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:58:44,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:58:44,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:58:44,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:58:44,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,577 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-09-25 10:58:44,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:58:44,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:58:44,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:58:44,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:58:44,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (1/1) ... [2024-09-25 10:58:44,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:58:44,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:58:44,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:58:44,639 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:58:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:58:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:58:44,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:58:44,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:58:44,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:58:44,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:58:44,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:58:44,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:58:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:58:44,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:58:44,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:58:44,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:58:44,771 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:58:44,776 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:58:44,907 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:58:44,907 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:58:44,934 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:58:44,934 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:58:44,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:58:44 BoogieIcfgContainer [2024-09-25 10:58:44,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:58:44,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:58:44,936 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:58:44,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:58:44,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:58:44" (1/3) ... [2024-09-25 10:58:44,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1649ccd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:58:44, skipping insertion in model container [2024-09-25 10:58:44,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:44" (2/3) ... [2024-09-25 10:58:44,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1649ccd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:58:44, skipping insertion in model container [2024-09-25 10:58:44,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:58:44" (3/3) ... [2024-09-25 10:58:44,945 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2024-09-25 10:58:44,962 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:58:44,962 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:58:45,031 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:58:45,040 INFO L336 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=All, 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;@434ed2c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:58:45,040 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:58:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:58:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:58:45,051 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:58:45,052 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:58:45,052 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:58:45,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-25 10:58:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:58:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664485602] [2024-09-25 10:58:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:58:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:45,188 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:58:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:45,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:58:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:58:45,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:58:45,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664485602] [2024-09-25 10:58:45,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664485602] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:58:45,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:58:45,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:58:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334934699] [2024-09-25 10:58:45,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:58:45,222 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:58:45,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:58:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:58:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:58:45,253 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:58:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:58:45,281 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-25 10:58:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:58:45,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:58:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:58:45,292 INFO L225 Difference]: With dead ends: 42 [2024-09-25 10:58:45,293 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 10:58:45,296 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:58:45,302 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:58:45,303 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:58:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 10:58:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-25 10:58:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:58:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-25 10:58:45,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-25 10:58:45,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:58:45,340 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-25 10:58:45,340 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:58:45,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-25 10:58:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:58:45,342 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:58:45,343 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:58:45,343 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:58:45,343 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:58:45,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-25 10:58:45,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:58:45,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981996108] [2024-09-25 10:58:45,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:45,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:58:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-25 10:58:45,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-25 10:58:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-25 10:58:45,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-25 10:58:45,398 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-25 10:58:45,399 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 10:58:45,401 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:58:45,403 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-25 10:58:45,426 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 10:58:45,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.09 10:58:45 BoogieIcfgContainer [2024-09-25 10:58:45,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-25 10:58:45,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-25 10:58:45,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-25 10:58:45,432 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-25 10:58:45,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:58:44" (3/4) ... [2024-09-25 10:58:45,434 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-09-25 10:58:45,435 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-25 10:58:45,436 INFO L158 Benchmark]: Toolchain (without parser) took 1171.31ms. Allocated memory is still 62.9MB. Free memory was 40.9MB in the beginning and 30.2MB in the end (delta: 10.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-09-25 10:58:45,437 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:58:45,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.70ms. Allocated memory is still 62.9MB. Free memory was 40.7MB in the beginning and 29.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 10:58:45,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.65ms. Allocated memory is still 62.9MB. Free memory was 29.3MB in the beginning and 28.4MB in the end (delta: 919.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:58:45,439 INFO L158 Benchmark]: Boogie Preprocessor took 46.31ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 26.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 10:58:45,439 INFO L158 Benchmark]: RCFGBuilder took 337.27ms. Allocated memory is still 62.9MB. Free memory was 26.4MB in the beginning and 36.4MB in the end (delta: -10.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-09-25 10:58:45,440 INFO L158 Benchmark]: TraceAbstraction took 494.05ms. Allocated memory is still 62.9MB. Free memory was 35.5MB in the beginning and 30.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-09-25 10:58:45,440 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 62.9MB. Free memory was 30.6MB in the beginning and 30.2MB in the end (delta: 374.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 10:58:45,445 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.19ms. Allocated memory is still 50.3MB. Free memory was 33.0MB in the beginning and 32.9MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.70ms. Allocated memory is still 62.9MB. Free memory was 40.7MB in the beginning and 29.3MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.65ms. Allocated memory is still 62.9MB. Free memory was 29.3MB in the beginning and 28.4MB in the end (delta: 919.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.31ms. Allocated memory is still 62.9MB. Free memory was 28.4MB in the beginning and 26.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.27ms. Allocated memory is still 62.9MB. Free memory was 26.4MB in the beginning and 36.4MB in the end (delta: -10.0MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * TraceAbstraction took 494.05ms. Allocated memory is still 62.9MB. Free memory was 35.5MB in the beginning and 30.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 62.9MB. Free memory was 30.6MB in the beginning and 30.2MB in the end (delta: 374.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=50) VAL [\old(cond)=1] [L14] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(a>=0 && a<=50) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L19] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, 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, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 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-09-25 10:58:45,481 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:58:47,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:58:47,605 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-25 10:58:47,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:58:47,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:58:47,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:58:47,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:58:47,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:58:47,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:58:47,649 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:58:47,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:58:47,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:58:47,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:58:47,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:58:47,653 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:58:47,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:58:47,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:58:47,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:58:47,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:58:47,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:58:47,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:58:47,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:58:47,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:58:47,659 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-25 10:58:47,659 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-25 10:58:47,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:58:47,660 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-25 10:58:47,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:58:47,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:58:47,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:58:47,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:58:47,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:58:47,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:58:47,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:58:47,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:58:47,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:58:47,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:58:47,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:58:47,666 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-25 10:58:47,666 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-25 10:58:47,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:58:47,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:58:47,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:58:47,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:58:47,668 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-25 10:58:47,668 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> 2fdde3d352865d24f00edfb02cdd5994421923a5ea92d15a0168523776b8ab34 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:58:48,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:58:48,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:58:48,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:58:48,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:58:48,034 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:58:48,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-09-25 10:58:49,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:58:49,857 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:58:49,858 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-09-25 10:58:49,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/288e4cd96/ece2298206114af2bca8c7c3c467663e/FLAG8019ee767 [2024-09-25 10:58:50,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/288e4cd96/ece2298206114af2bca8c7c3c467663e [2024-09-25 10:58:50,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:58:50,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:58:50,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:58:50,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:58:50,234 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:58:50,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5357afdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50, skipping insertion in model container [2024-09-25 10:58:50,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,253 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:58:50,391 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-09-25 10:58:50,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:58:50,428 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:58:50,440 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c[712,725] [2024-09-25 10:58:50,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:58:50,469 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:58:50,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50 WrapperNode [2024-09-25 10:58:50,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:58:50,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:58:50,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:58:50,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:58:50,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,495 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:58:50,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:58:50,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:58:50,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:58:50,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:58:50,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,539 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-09-25 10:58:50,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:58:50,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:58:50,567 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:58:50,567 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:58:50,568 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (1/1) ... [2024-09-25 10:58:50,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:58:50,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:58:50,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:58:50,609 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:58:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:58:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-25 10:58:50,655 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:58:50,656 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:58:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:58:50,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:58:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:58:50,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:58:50,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:58:50,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:58:50,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:58:50,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:58:50,725 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:58:50,727 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:58:51,759 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-25 10:58:51,759 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:58:51,795 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:58:51,796 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 10:58:51,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:58:51 BoogieIcfgContainer [2024-09-25 10:58:51,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:58:51,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:58:51,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:58:51,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:58:51,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:58:50" (1/3) ... [2024-09-25 10:58:51,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81e4e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:58:51, skipping insertion in model container [2024-09-25 10:58:51,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:58:50" (2/3) ... [2024-09-25 10:58:51,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81e4e09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:58:51, skipping insertion in model container [2024-09-25 10:58:51,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:58:51" (3/3) ... [2024-09-25 10:58:51,809 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2024-09-25 10:58:51,827 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:58:51,827 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:58:51,902 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:58:51,910 INFO L336 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=All, 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;@650d5e27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:58:51,911 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:58:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:58:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:58:51,922 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:58:51,924 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:58:51,935 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:58:51,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-25 10:58:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 10:58:51,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332466678] [2024-09-25 10:58:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:51,957 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-09-25 10:58:51,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 10:58:51,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-25 10:58:51,961 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-25 10:58:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:52,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-25 10:58:52,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:58:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:58:52,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:58:52,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 10:58:52,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332466678] [2024-09-25 10:58:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332466678] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:58:52,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:58:52,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:58:52,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553826253] [2024-09-25 10:58:52,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:58:52,300 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:58:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 10:58:52,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:58:52,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:58:52,323 INFO L87 Difference]: Start difference. First operand has 25 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:58:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:58:52,351 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-25 10:58:52,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:58:52,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-25 10:58:52,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:58:52,360 INFO L225 Difference]: With dead ends: 42 [2024-09-25 10:58:52,360 INFO L226 Difference]: Without dead ends: 21 [2024-09-25 10:58:52,364 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:58:52,367 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:58:52,368 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:58:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-25 10:58:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-25 10:58:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:58:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-25 10:58:52,397 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-25 10:58:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:58:52,397 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-25 10:58:52,397 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:58:52,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:52,398 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-25 10:58:52,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:58:52,399 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:58:52,399 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:58:52,410 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-25 10:58:52,600 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/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-09-25 10:58:52,600 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:58:52,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:58:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-25 10:58:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 10:58:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437645192] [2024-09-25 10:58:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:52,602 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-09-25 10:58:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 10:58:52,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-25 10:58:52,608 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-25 10:58:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-25 10:58:52,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-25 10:58:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-25 10:58:53,149 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-25 10:58:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1996466748] [2024-09-25 10:58:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:58:53,149 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-25 10:58:53,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-25 10:58:53,174 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-25 10:58:53,177 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-09-25 10:58:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:58:53,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:58:53,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:59:17,955 WARN L293 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 10:59:47,300 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (and (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32))))))) is different from false [2024-09-25 10:59:59,467 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:00:07,588 WARN L293 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:00:14,082 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:00:35,203 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3)))) (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32))))))) is different from false [2024-09-25 11:00:47,309 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:00:53,121 WARN L293 SmtUtils]: Spent 5.81s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:00:58,264 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:01:02,297 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from false [2024-09-25 11:01:06,321 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32)))))) is different from true [2024-09-25 11:01:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 11:01:06,321 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:01:06,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:01:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437645192] [2024-09-25 11:01:06,322 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 11:01:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1996466748] [2024-09-25 11:01:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1996466748] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:01:06,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:01:06,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-25 11:01:06,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627768713] [2024-09-25 11:01:06,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:01:06,324 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 11:01:06,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:01:06,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 11:01:06,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=39, Unknown=4, NotChecked=42, Total=110 [2024-09-25 11:01:06,325 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:01:16,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:19,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:23,269 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |c_#memory_int#0| (_ bv1 32)) (_ bv1 32))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv50 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)) (and (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-09-25 11:01:27,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:31,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:32,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:33,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:38,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:42,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:46,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:50,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:54,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:55,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-25 11:01:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:01:55,950 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-25 11:01:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:01:55,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-09-25 11:01:55,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:01:55,988 INFO L225 Difference]: With dead ends: 31 [2024-09-25 11:01:55,988 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 11:01:55,988 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=49, Invalid=94, Unknown=5, NotChecked=92, Total=240 [2024-09-25 11:01:55,989 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2024-09-25 11:01:55,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 8 Unknown, 104 Unchecked, 40.9s Time] [2024-09-25 11:01:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 11:01:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-25 11:01:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 11:01:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-25 11:01:56,002 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2024-09-25 11:01:56,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:01:56,003 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-25 11:01:56,003 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 11:01:56,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:01:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-25 11:01:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:01:56,004 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:01:56,005 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 11:01:56,025 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-09-25 11:01:56,214 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-09-25 11:01:56,405 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/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 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-25 11:01:56,406 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:01:56,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:01:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -711167633, now seen corresponding path program 1 times [2024-09-25 11:01:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:01:56,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106345419] [2024-09-25 11:01:56,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:01:56,407 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-09-25 11:01:56,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:01:56,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/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-09-25 11:01:56,410 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/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-09-25 11:01:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:01:56,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 11:01:56,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:02:04,938 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:02:08,980 WARN L854 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_main_~r~0 c_main_~r~0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_main_~x~0)))) is different from false [2024-09-25 11:02:13,023 WARN L876 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_main_~r~0 c_main_~r~0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_main_~x~0)))) is different from true [2024-09-25 11:02:21,106 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:02:33,255 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:02:37,295 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2024-09-25 11:02:49,451 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:02:53,493 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) is different from false [2024-09-25 11:02:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-25 11:02:53,504 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:03:01,705 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:03:09,806 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-25 11:03:26,113 WARN L293 SmtUtils]: Spent 16.24s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)