./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound100.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_valuebound100.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 6d1ee9b66acccde8e4802bcc3b75479d1ab3cc8ee3ff178f121f64cc868a595d --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:18:48,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:18:48,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 19:18:48,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:18:48,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:18:48,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:18:48,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:18:48,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:18:48,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:18:48,738 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:18:48,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:18:48,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:18:48,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:18:48,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:18:48,739 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:18:48,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:18:48,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:18:48,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:18:48,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 19:18:48,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:18:48,744 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:18:48,744 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:18:48,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:18:48,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:18:48,745 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:18:48,745 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:18:48,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:18:48,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:18:48,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:18:48,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:18:48,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:18:48,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:18:48,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:18:48,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:18:48,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:18:48,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:18:48,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 19:18:48,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 19:18:48,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:18:48,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:18:48,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:18:48,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:18:48,748 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 -> 6d1ee9b66acccde8e4802bcc3b75479d1ab3cc8ee3ff178f121f64cc868a595d 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:18:48,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:18:48,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:18:48,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:18:48,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:18:48,965 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:18:48,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound100.c [2024-09-20 19:18:50,298 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:18:50,434 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:18:50,435 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound100.c [2024-09-20 19:18:50,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/6ccc5843f/597c7cbfa575477baf87912e14c49d44/FLAG0ee9bf2f4 [2024-09-20 19:18:50,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/6ccc5843f/597c7cbfa575477baf87912e14c49d44 [2024-09-20 19:18:50,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:18:50,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:18:50,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:18:50,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:18:50,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:18:50,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c9b402b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50, skipping insertion in model container [2024-09-20 19:18:50,460 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:18:50,604 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_valuebound100.c[712,725] [2024-09-20 19:18:50,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:18:50,637 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:18:50,647 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_valuebound100.c[712,725] [2024-09-20 19:18:50,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:18:50,674 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:18:50,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50 WrapperNode [2024-09-20 19:18:50,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:18:50,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:18:50,681 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:18:50,681 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:18:50,693 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:18:50" (1/1) ... [2024-09-20 19:18:50,703 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:18:50" (1/1) ... [2024-09-20 19:18:50,709 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:18:50,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:18:50,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:18:50,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:18:50,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:18:50,718 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,746 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:18:50,746 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,746 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:18:50,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:18:50,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:18:50,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:18:50,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (1/1) ... [2024-09-20 19:18:50,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:18:50,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:18:50,816 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:18:50,829 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:18:50,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:18:50,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:18:50,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:18:50,859 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:18:50,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:18:50,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 19:18:50,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:18:50,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:18:50,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:18:50,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:18:50,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:18:50,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:18:50,913 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:18:50,915 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:18:50,994 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-20 19:18:50,995 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:18:51,010 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:18:51,010 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:18:51,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:18:51 BoogieIcfgContainer [2024-09-20 19:18:51,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:18:51,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:18:51,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:18:51,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:18:51,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:18:50" (1/3) ... [2024-09-20 19:18:51,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fb6c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:18:51, skipping insertion in model container [2024-09-20 19:18:51,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:50" (2/3) ... [2024-09-20 19:18:51,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24fb6c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:18:51, skipping insertion in model container [2024-09-20 19:18:51,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:18:51" (3/3) ... [2024-09-20 19:18:51,016 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound100.c [2024-09-20 19:18:51,028 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:18:51,028 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:18:51,068 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:18:51,073 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;@66a5b518, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:18:51,074 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:18:51,076 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:18:51,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:18:51,081 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:18:51,082 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:18:51,082 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:18:51,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:18:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-20 19:18:51,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:18:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011204211] [2024-09-20 19:18:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:18:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:18:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:18:51,207 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 19:18:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:18:51,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 19:18:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:18:51,230 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:18:51,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 19:18:51,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011204211] [2024-09-20 19:18:51,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011204211] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:18:51,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:18:51,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 19:18:51,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417370661] [2024-09-20 19:18:51,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:18:51,237 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 19:18:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 19:18:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 19:18:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 19:18:51,255 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:18:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:18:51,271 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-20 19:18:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 19:18:51,273 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:18:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:18:51,278 INFO L225 Difference]: With dead ends: 42 [2024-09-20 19:18:51,278 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 19:18:51,280 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:18:51,283 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:18:51,283 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:18:51,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 19:18:51,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 19:18:51,306 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:18:51,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-20 19:18:51,308 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-20 19:18:51,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:18:51,308 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-20 19:18:51,308 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:18:51,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:18:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-20 19:18:51,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:18:51,309 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:18:51,309 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:18:51,310 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 19:18:51,310 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:18:51,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:18:51,310 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-20 19:18:51,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 19:18:51,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636962917] [2024-09-20 19:18:51,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:18:51,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 19:18:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:18:51,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-20 19:18:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:18:51,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-20 19:18:51,343 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-20 19:18:51,344 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-20 19:18:51,345 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-20 19:18:51,348 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-20 19:18:51,361 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-20 19:18:51,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 07:18:51 BoogieIcfgContainer [2024-09-20 19:18:51,368 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-20 19:18:51,369 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-20 19:18:51,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-20 19:18:51,370 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-20 19:18:51,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:18:51" (3/4) ... [2024-09-20 19:18:51,376 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-09-20 19:18:51,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-20 19:18:51,377 INFO L158 Benchmark]: Toolchain (without parser) took 924.75ms. Allocated memory is still 184.5MB. Free memory was 116.7MB in the beginning and 114.2MB in the end (delta: 2.4MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-09-20 19:18:51,377 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:18:51,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.24ms. Allocated memory is still 184.5MB. Free memory was 116.5MB in the beginning and 155.2MB in the end (delta: -38.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-09-20 19:18:51,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.31ms. Allocated memory is still 184.5MB. Free memory was 155.2MB in the beginning and 155.0MB in the end (delta: 239.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:18:51,379 INFO L158 Benchmark]: Boogie Preprocessor took 56.58ms. Allocated memory is still 184.5MB. Free memory was 154.1MB in the beginning and 153.2MB in the end (delta: 918.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-20 19:18:51,384 INFO L158 Benchmark]: RCFGBuilder took 243.34ms. Allocated memory is still 184.5MB. Free memory was 153.2MB in the beginning and 140.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-20 19:18:51,384 INFO L158 Benchmark]: TraceAbstraction took 355.75ms. Allocated memory is still 184.5MB. Free memory was 139.4MB in the beginning and 115.2MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-09-20 19:18:51,384 INFO L158 Benchmark]: Witness Printer took 7.16ms. Allocated memory is still 184.5MB. Free memory was 115.2MB in the beginning and 114.2MB in the end (delta: 920.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-20 19:18:51,386 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.24ms. Allocated memory is still 184.5MB. Free memory was 116.5MB in the beginning and 155.2MB in the end (delta: -38.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.31ms. Allocated memory is still 184.5MB. Free memory was 155.2MB in the beginning and 155.0MB in the end (delta: 239.3kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.58ms. Allocated memory is still 184.5MB. Free memory was 154.1MB in the beginning and 153.2MB in the end (delta: 918.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 243.34ms. Allocated memory is still 184.5MB. Free memory was 153.2MB in the beginning and 140.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 355.75ms. Allocated memory is still 184.5MB. Free memory was 139.4MB in the beginning and 115.2MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 7.16ms. Allocated memory is still 184.5MB. Free memory was 115.2MB in the beginning and 114.2MB in the end (delta: 920.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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<=100) VAL [\old(cond)=1] [L14] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(a>=0 && a<=100) [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.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s 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:18:51,420 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_valuebound100.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 6d1ee9b66acccde8e4802bcc3b75479d1ab3cc8ee3ff178f121f64cc868a595d --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:18:53,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 19:18:53,361 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-20 19:18:53,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 19:18:53,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 19:18:53,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 19:18:53,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 19:18:53,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 19:18:53,399 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 19:18:53,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 19:18:53,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 19:18:53,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 19:18:53,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 19:18:53,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 19:18:53,403 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 19:18:53,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 19:18:53,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 19:18:53,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 19:18:53,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 19:18:53,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 19:18:53,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 19:18:53,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 19:18:53,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 19:18:53,405 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-20 19:18:53,405 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-20 19:18:53,405 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 19:18:53,405 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-20 19:18:53,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 19:18:53,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 19:18:53,406 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 19:18:53,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 19:18:53,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 19:18:53,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 19:18:53,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 19:18:53,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:18:53,407 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 19:18:53,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 19:18:53,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 19:18:53,408 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-20 19:18:53,408 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-20 19:18:53,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 19:18:53,409 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 19:18:53,409 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 19:18:53,409 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 19:18:53,410 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-20 19:18:53,410 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 -> 6d1ee9b66acccde8e4802bcc3b75479d1ab3cc8ee3ff178f121f64cc868a595d 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:18:53,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 19:18:53,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 19:18:53,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 19:18:53,682 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 19:18:53,683 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 19:18:53,684 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound100.c [2024-09-20 19:18:54,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 19:18:55,095 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 19:18:55,096 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound100.c [2024-09-20 19:18:55,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b7f162e2d/a1da45aa0d6c4e08bd607c22af84207c/FLAG422581633 [2024-09-20 19:18:55,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b7f162e2d/a1da45aa0d6c4e08bd607c22af84207c [2024-09-20 19:18:55,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 19:18:55,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 19:18:55,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 19:18:55,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 19:18:55,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 19:18:55,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34788f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55, skipping insertion in model container [2024-09-20 19:18:55,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 19:18:55,680 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_valuebound100.c[712,725] [2024-09-20 19:18:55,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:18:55,700 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 19:18:55,709 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_valuebound100.c[712,725] [2024-09-20 19:18:55,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 19:18:55,724 INFO L204 MainTranslator]: Completed translation [2024-09-20 19:18:55,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55 WrapperNode [2024-09-20 19:18:55,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 19:18:55,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 19:18:55,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 19:18:55,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 19:18:55,731 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:18:55" (1/1) ... [2024-09-20 19:18:55,737 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:18:55" (1/1) ... [2024-09-20 19:18:55,741 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 19:18:55,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 19:18:55,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 19:18:55,743 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 19:18:55,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 19:18:55,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,752 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,766 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:18:55,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,781 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 19:18:55,787 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 19:18:55,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 19:18:55,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 19:18:55,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (1/1) ... [2024-09-20 19:18:55,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 19:18:55,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 19:18:55,815 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:18:55,822 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:18:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 19:18:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-20 19:18:55,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 19:18:55,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 19:18:55,872 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 19:18:55,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 19:18:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 19:18:55,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 19:18:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 19:18:55,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 19:18:55,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 19:18:55,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 19:18:55,932 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 19:18:55,936 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 19:18:56,751 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-20 19:18:56,751 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 19:18:56,788 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 19:18:56,788 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 19:18:56,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:18:56 BoogieIcfgContainer [2024-09-20 19:18:56,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 19:18:56,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 19:18:56,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 19:18:56,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 19:18:56,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 07:18:55" (1/3) ... [2024-09-20 19:18:56,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e34f4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:18:56, skipping insertion in model container [2024-09-20 19:18:56,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 07:18:55" (2/3) ... [2024-09-20 19:18:56,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e34f4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 07:18:56, skipping insertion in model container [2024-09-20 19:18:56,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 07:18:56" (3/3) ... [2024-09-20 19:18:56,797 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound100.c [2024-09-20 19:18:56,810 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 19:18:56,810 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 19:18:56,860 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 19:18:56,866 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;@20a1020, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 19:18:56,867 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 19:18:56,870 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:18:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:18:56,875 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:18:56,876 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:18:56,877 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:18:56,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:18:56,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-20 19:18:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:18:56,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158127464] [2024-09-20 19:18:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:18:56,892 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:18:56,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:18:56,895 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:18:56,896 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:18:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:18:57,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-20 19:18:57,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:18:57,182 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:18:57,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:18:57,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:18:57,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158127464] [2024-09-20 19:18:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1158127464] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:18:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:18:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 19:18:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908311] [2024-09-20 19:18:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:18:57,189 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 19:18:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:18:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 19:18:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 19:18:57,208 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:18:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:18:57,233 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-20 19:18:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 19:18:57,236 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:18:57,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:18:57,242 INFO L225 Difference]: With dead ends: 42 [2024-09-20 19:18:57,242 INFO L226 Difference]: Without dead ends: 21 [2024-09-20 19:18:57,245 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:18:57,248 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:18:57,250 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:18:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-20 19:18:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-20 19:18:57,275 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:18:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-20 19:18:57,278 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-20 19:18:57,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:18:57,279 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-20 19:18:57,279 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:18:57,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:18:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-20 19:18:57,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 19:18:57,281 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:18:57,281 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:18:57,292 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-20 19:18:57,482 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:18:57,483 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:18:57,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:18:57,484 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-20 19:18:57,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:18:57,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023703693] [2024-09-20 19:18:57,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:18:57,487 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:18:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:18:57,490 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:18:57,491 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:18:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:18:57,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-20 19:18:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-20 19:18:57,995 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-20 19:18:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2005891696] [2024-09-20 19:18:57,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:18:57,999 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-20 19:18:57,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-20 19:18:58,005 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:18:58,006 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:18:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:18:58,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-20 19:18:58,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:19:23,462 WARN L293 SmtUtils]: Spent 7.76s 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:19:36,120 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:19:40,163 WARN L854 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (and (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.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv100 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) is different from false [2024-09-20 19:19:52,294 WARN L293 SmtUtils]: Spent 8.05s 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:19:57,303 WARN L293 SmtUtils]: Spent 5.01s 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:20:05,444 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-20 19:20:46,848 WARN L293 SmtUtils]: Spent 22.83s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-20 19:20:57,473 WARN L293 SmtUtils]: Spent 6.59s 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:21:03,742 WARN L293 SmtUtils]: Spent 6.27s 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:21:11,440 WARN L293 SmtUtils]: Spent 7.70s 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:21:15,470 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.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv100 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from false [2024-09-20 19:21:19,495 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.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv100 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from true [2024-09-20 19:21:19,495 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:19,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 19:21:19,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-20 19:21:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023703693] [2024-09-20 19:21:19,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 19:21:19,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2005891696] [2024-09-20 19:21:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2005891696] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 19:21:19,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 19:21:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-20 19:21:19,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386049681] [2024-09-20 19:21:19,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 19:21:19,497 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-20 19:21:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-20 19:21:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-20 19:21:19,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=50, Unknown=5, NotChecked=30, Total=110 [2024-09-20 19:21:19,500 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:21:30,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s 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:21:34,395 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:21:38,399 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:21:42,403 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:21:46,408 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 [0] [2024-09-20 19:21:50,498 WARN L854 $PredicateComparison]: unable to prove that (and (= ((_ sign_extend 24) (_ bv0 8)) (select (select |c_#memory_int#0| (_ bv1 32)) (_ bv1 32))) (or (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|) (and (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.leq v_main_~a~0_BEFORE_CALL_1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv100 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-09-20 19:21:54,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:21:58,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:22:02,612 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 [0] [2024-09-20 19:22:06,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:22:10,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:22:14,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:22:18,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:22:22,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:22:26,880 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:22:28,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s 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:22:30,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s 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:22:32,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s 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:22:34,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:22:35,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s 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:22:39,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s 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:22:43,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:22:47,977 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:22:51,984 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:22:55,987 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:22:59,991 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 [0] [2024-09-20 19:23:04,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-20 19:23:08,204 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:23:12,209 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:23:16,212 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:23:20,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-20 19:23:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 19:23:20,700 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-20 19:23:20,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 19:23:20,740 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:23:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 19:23:20,741 INFO L225 Difference]: With dead ends: 31 [2024-09-20 19:23:20,741 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 19:23:20,742 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 67.4s TimeCoverageRelationStatistics Valid=49, Invalid=113, Unknown=6, NotChecked=72, Total=240 [2024-09-20 19:23:20,742 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 110.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 111.3s IncrementalHoareTripleChecker+Time [2024-09-20 19:23:20,743 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 62 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 24 Unknown, 64 Unchecked, 111.3s Time] [2024-09-20 19:23:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 19:23:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-20 19:23:20,764 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:23:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-20 19:23:20,768 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2024-09-20 19:23:20,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 19:23:20,768 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-20 19:23:20,768 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:23:20,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:23:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-20 19:23:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-20 19:23:20,769 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 19:23:20,769 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:23:20,792 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:23:20,979 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-09-20 19:23:21,173 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:23:21,174 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 19:23:21,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 19:23:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -711167633, now seen corresponding path program 1 times [2024-09-20 19:23:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-20 19:23:21,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983065959] [2024-09-20 19:23:21,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 19:23:21,175 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:23:21,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-20 19:23:21,177 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:23:21,178 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:23:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 19:23:21,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-20 19:23:21,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 19:23:29,648 WARN L293 SmtUtils]: Spent 8.11s 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:33,699 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:23:37,746 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