./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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ca4ee3dd Calling Ultimate with: /root/.sdkman/candidates/java/current/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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 19:21:43,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:21:43,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:21:43,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:21:43,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:21:43,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:21:43,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:21:43,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:21:43,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:21:43,333 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:21:43,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:21:43,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:21:43,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:21:43,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:21:43,339 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:21:43,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:21:43,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:21:43,340 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:21:43,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:21:43,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:21:43,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:21:43,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:21:43,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:21:43,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:21:43,346 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:21:43,347 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:21:43,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:21:43,347 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:21:43,347 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:21:43,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:21:43,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:21:43,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:21:43,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:21:43,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:21:43,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:21:43,349 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:21:43,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:21:43,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:21:43,350 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:21:43,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:21:43,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:21:43,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:21:43,354 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 19:21:43,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:21:43,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:21:43,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:21:43,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:21:43,642 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:21:43,643 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-20 19:21:45,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:21:45,315 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:21:45,315 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-09-20 19:21:45,321 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/88873ec54/6b35fea5ecf54327ba75e518390adedb/FLAG0eca10c2b [2024-09-20 19:21:45,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/88873ec54/6b35fea5ecf54327ba75e518390adedb [2024-09-20 19:21:45,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:21:45,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:21:45,339 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:21:45,339 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:21:45,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:21:45,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5001d2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45, skipping insertion in model container [2024-09-20 19:21:45,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:21:45,535 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-20 19:21:45,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:21:45,569 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:21:45,581 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-20 19:21:45,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:21:45,612 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:21:45,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45 WrapperNode [2024-09-20 19:21:45,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:21:45,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:21:45,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:21:45,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:21:45,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,637 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:21:45,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:21:45,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:21:45,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:21:45,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:21:45,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,678 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-20 19:21:45,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,682 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,686 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:21:45,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:21:45,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:21:45,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:21:45,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (1/1) ... [2024-09-20 19:21:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:21:45,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:21:45,732 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-20 19:21:45,738 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-20 19:21:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:21:45,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:21:45,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:21:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:21:45,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:21:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:21:45,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:21:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:21:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:21:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:21:45,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:21:45,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:21:45,853 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:21:45,856 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:21:46,023 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-20 19:21:46,023 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:21:46,050 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:21:46,051 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:21:46,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:21:46 BoogieIcfgContainer [2024-09-20 19:21:46,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:21:46,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:21:46,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:21:46,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:21:46,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:21:45" (1/3) ... [2024-09-20 19:21:46,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c41d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:21:46, skipping insertion in model container [2024-09-20 19:21:46,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:45" (2/3) ... [2024-09-20 19:21:46,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c41d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:21:46, skipping insertion in model container [2024-09-20 19:21:46,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:21:46" (3/3) ... [2024-09-20 19:21:46,065 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2024-09-20 19:21:46,083 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:21:46,083 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:21:46,156 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:21:46,165 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;@16b4777, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:21:46,166 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:21:46,171 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-20 19:21:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:21:46,181 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:21:46,181 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:21:46,182 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:21:46,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:21:46,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-20 19:21:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:21:46,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138105904] [2024-09-20 19:21:46,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:21:46,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:21:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:21:46,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:21:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:21:46,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:21:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:21:46,393 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-20 19:21:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:21:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138105904] [2024-09-20 19:21:46,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138105904] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:21:46,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:21:46,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 19:21:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225729221] [2024-09-20 19:21:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:21:46,404 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 19:21:46,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:21:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 19:21:46,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 19:21:46,434 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-20 19:21:46,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:21:46,456 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-20 19:21:46,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 19:21:46,458 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-20 19:21:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:21:46,465 INFO L225 Difference]: With dead ends: 42 [2024-09-20 19:21:46,465 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 19:21:46,468 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-20 19:21:46,471 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-20 19:21:46,472 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-20 19:21:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 19:21:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 19:21:46,501 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-20 19:21:46,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-20 19:21:46,504 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-20 19:21:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:21:46,504 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-20 19:21:46,504 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-20 19:21:46,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:21:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-20 19:21:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:21:46,506 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:21:46,506 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:21:46,507 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:21:46,507 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:21:46,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:21:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-20 19:21:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:21:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943559182] [2024-09-20 19:21:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:21:46,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:21:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:21:46,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-20 19:21:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:21:46,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-20 19:21:46,587 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-20 19:21:46,589 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:21:46,590 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 19:21:46,594 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-20 19:21:46,610 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:21:46,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:21:46 BoogieIcfgContainer [2024-09-20 19:21:46,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:21:46,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:21:46,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:21:46,614 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:21:46,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:21:46" (3/4) ... [2024-09-20 19:21:46,617 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-09-20 19:21:46,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:21:46,618 INFO L158 Benchmark]: Toolchain (without parser) took 1280.06ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 99.9MB in the end (delta: 52.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-09-20 19:21:46,619 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 130.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:21:46,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 140.7MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-20 19:21:46,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.82ms. Allocated memory is still 209.7MB. Free memory was 140.7MB in the beginning and 139.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:21:46,620 INFO L158 Benchmark]: Boogie Preprocessor took 56.30ms. Allocated memory is still 209.7MB. Free memory was 139.7MB in the beginning and 138.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:21:46,620 INFO L158 Benchmark]: RCFGBuilder took 357.32ms. Allocated memory is still 209.7MB. Free memory was 138.1MB in the beginning and 125.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:21:46,621 INFO L158 Benchmark]: TraceAbstraction took 558.45ms. Allocated memory is still 209.7MB. Free memory was 125.0MB in the beginning and 100.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-09-20 19:21:46,621 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 209.7MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:21:46,624 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.20ms. Allocated memory is still 130.0MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.72ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 140.7MB in the end (delta: 11.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.82ms. Allocated memory is still 209.7MB. Free memory was 140.7MB in the beginning and 139.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.30ms. Allocated memory is still 209.7MB. Free memory was 139.7MB in the beginning and 138.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.32ms. Allocated memory is still 209.7MB. Free memory was 138.1MB in the beginning and 125.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 558.45ms. Allocated memory is still 209.7MB. Free memory was 125.0MB in the beginning and 100.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 209.7MB. Free memory is still 99.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 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.1s 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-20 19:21:46,651 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-ca4ee3d-m [2024-09-20 19:21:48,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:21:48,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-20 19:21:48,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:21:48,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:21:48,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:21:48,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:21:48,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:21:48,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:21:48,992 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:21:48,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:21:48,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:21:48,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:21:48,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:21:48,996 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:21:48,996 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:21:48,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:21:48,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:21:48,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:21:48,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:21:48,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:21:49,001 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:21:49,001 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:21:49,002 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-20 19:21:49,002 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-20 19:21:49,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:21:49,002 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-20 19:21:49,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:21:49,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:21:49,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:21:49,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:21:49,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:21:49,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:21:49,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:21:49,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:21:49,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:21:49,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:21:49,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:21:49,007 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-20 19:21:49,007 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-20 19:21:49,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:21:49,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:21:49,008 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:21:49,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:21:49,009 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-20 19:21:49,010 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 19:21:49,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:21:49,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:21:49,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:21:49,374 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:21:49,375 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:21:49,377 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-20 19:21:50,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:21:51,178 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:21:51,180 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound50.c [2024-09-20 19:21:51,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5fc843837/67ba33802871455bad26b246c6c9e897/FLAG992364f65 [2024-09-20 19:21:51,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5fc843837/67ba33802871455bad26b246c6c9e897 [2024-09-20 19:21:51,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:21:51,216 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:21:51,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:21:51,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:21:51,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:21:51,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5878ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51, skipping insertion in model container [2024-09-20 19:21:51,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:21:51,421 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-20 19:21:51,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:21:51,456 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:21:51,469 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-20 19:21:51,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:21:51,500 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:21:51,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51 WrapperNode [2024-09-20 19:21:51,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:21:51,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:21:51,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:21:51,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:21:51,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,532 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:21:51,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:21:51,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:21:51,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:21:51,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:21:51,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,565 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-20 19:21:51,565 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,565 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:21:51,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:21:51,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:21:51,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:21:51,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (1/1) ... [2024-09-20 19:21:51,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:21:51,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:21:51,623 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-20 19:21:51,626 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-20 19:21:51,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:21:51,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-20 19:21:51,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:21:51,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:21:51,674 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:21:51,675 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:21:51,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:21:51,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:21:51,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:21:51,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:21:51,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:21:51,675 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:21:51,749 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:21:51,753 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:21:52,701 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-20 19:21:52,702 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:21:52,727 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:21:52,728 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:21:52,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:21:52 BoogieIcfgContainer [2024-09-20 19:21:52,730 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:21:52,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:21:52,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:21:52,736 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:21:52,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:21:51" (1/3) ... [2024-09-20 19:21:52,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf2725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:21:52, skipping insertion in model container [2024-09-20 19:21:52,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:21:51" (2/3) ... [2024-09-20 19:21:52,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf2725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:21:52, skipping insertion in model container [2024-09-20 19:21:52,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:21:52" (3/3) ... [2024-09-20 19:21:52,741 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound50.c [2024-09-20 19:21:52,757 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:21:52,758 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:21:52,822 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:21:52,829 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;@12ef6ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:21:52,830 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:21:52,834 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-20 19:21:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:21:52,841 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:21:52,841 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:21:52,842 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:21:52,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:21:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-20 19:21:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:21:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200710008] [2024-09-20 19:21:52,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:21:52,860 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-20 19:21:52,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:21:52,864 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-20 19:21:52,865 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-20 19:21:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:21:53,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-20 19:21:53,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:21:53,240 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-20 19:21:53,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:21:53,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:21:53,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200710008] [2024-09-20 19:21:53,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200710008] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:21:53,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:21:53,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 19:21:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645515206] [2024-09-20 19:21:53,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:21:53,255 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 19:21:53,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:21:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 19:21:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 19:21:53,280 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-20 19:21:53,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:21:53,313 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-20 19:21:53,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 19:21:53,316 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-20 19:21:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:21:53,323 INFO L225 Difference]: With dead ends: 42 [2024-09-20 19:21:53,323 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 19:21:53,327 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-20 19:21:53,332 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-20 19:21:53,332 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-20 19:21:53,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 19:21:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 19:21:53,367 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-20 19:21:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-20 19:21:53,370 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-20 19:21:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:21:53,372 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-20 19:21:53,373 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-20 19:21:53,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:21:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-20 19:21:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:21:53,374 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:21:53,374 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 19:21:53,390 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 (2)] Forceful destruction successful, exit code 0 [2024-09-20 19:21:53,575 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-20 19:21:53,575 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:21:53,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:21:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-20 19:21:53,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:21:53,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959182572] [2024-09-20 19:21:53,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:21:53,577 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-20 19:21:53,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:21:53,581 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-20 19:21:53,583 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-20 19:21:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:21:53,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-20 19:21:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:21:54,138 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-20 19:21:54,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [968167745] [2024-09-20 19:21:54,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:21:54,139 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-20 19:21:54,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-20 19:21:54,165 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-20 19:21:54,167 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-20 19:21:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:21:54,831 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 19:21:54,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:22:24,691 WARN L293 SmtUtils]: Spent 8.11s 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-20 19:22:29,927 WARN L293 SmtUtils]: Spent 5.23s 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-20 19:22:49,759 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-20 19:23:00,236 WARN L293 SmtUtils]: Spent 6.38s 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-20 19:23:08,358 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-20 19:23:14,067 WARN L293 SmtUtils]: Spent 5.71s 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-20 19:23:35,154 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-20 19:23:47,266 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-20 19:23:52,918 WARN L293 SmtUtils]: Spent 5.65s 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-20 19:24:01,190 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-20 19:24:05,216 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-20 19:24:05,217 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-20 19:24:05,218 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:24:05,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:24:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959182572] [2024-09-20 19:24:05,218 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:24:05,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [968167745] [2024-09-20 19:24:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [968167745] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:24:05,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:24:05,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-20 19:24:05,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972879723] [2024-09-20 19:24:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:24:05,220 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:24:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:24:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:24:05,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=39, Unknown=4, NotChecked=42, Total=110 [2024-09-20 19:24:05,223 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-20 19:24:14,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:18,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:22,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:26,408 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-20 19:24:30,581 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-20 19:24:31,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:33,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:34,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:38,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:43,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:47,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:24:51,987 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-20 19:24:55,991 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-20 19:24:59,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:25:02,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:25:06,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:25:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:25:06,503 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-20 19:25:06,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 19:25:06,541 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-20 19:25:06,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:25:06,542 INFO L225 Difference]: With dead ends: 31 [2024-09-20 19:25:06,542 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 19:25:06,543 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=49, Invalid=94, Unknown=5, NotChecked=92, Total=240 [2024-09-20 19:25:06,544 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 51.2s IncrementalHoareTripleChecker+Time [2024-09-20 19:25:06,545 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 10 Unknown, 104 Unchecked, 51.2s Time] [2024-09-20 19:25:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 19:25:06,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-20 19:25:06,555 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-20 19:25:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-20 19:25:06,556 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2024-09-20 19:25:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:25:06,557 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-20 19:25:06,557 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-20 19:25:06,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:25:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-20 19:25:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-20 19:25:06,558 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:25:06,559 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-20 19:25:06,577 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-20 19:25:06,767 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-09-20 19:25:06,959 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-20 19:25:06,960 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:25:06,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:25:06,961 INFO L85 PathProgramCache]: Analyzing trace with hash -711167633, now seen corresponding path program 1 times [2024-09-20 19:25:06,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:25:06,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831352916] [2024-09-20 19:25:06,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:25:06,961 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-20 19:25:06,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:25:06,963 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-20 19:25:06,964 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-20 19:25:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:25:07,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:25:07,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:25:15,437 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-20 19:25:19,483 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-20 19:25:23,528 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-20 19:25:31,611 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-20 19:25:43,762 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-20 19:25:47,807 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-20 19:25:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 19:25:50,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 19:25:58,433 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-20 19:26:06,527 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-20 19:26:22,804 WARN L293 SmtUtils]: Spent 16.23s 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)