./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 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_valuebound20.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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 16:00:27,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 16:00:27,941 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 16:00:27,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 16:00:27,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 16:00:27,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 16:00:27,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 16:00:27,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 16:00:27,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 16:00:27,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 16:00:27,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 16:00:27,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 16:00:27,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 16:00:27,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 16:00:27,983 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 16:00:27,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 16:00:27,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 16:00:27,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 16:00:27,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 16:00:27,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 16:00:27,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 16:00:27,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 16:00:27,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 16:00:27,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 16:00:27,986 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 16:00:27,986 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 16:00:27,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 16:00:27,987 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 16:00:27,987 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 16:00:27,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 16:00:27,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 16:00:27,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 16:00:27,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 16:00:27,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 16:00:27,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 16:00:27,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 16:00:27,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 16:00:27,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 16:00:27,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 16:00:27,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 16:00:27,991 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 16:00:27,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 16:00:27,992 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a 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 [2024-09-12 16:00:28,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 16:00:28,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 16:00:28,323 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 16:00:28,324 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 16:00:28,325 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 16:00:28,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-12 16:00:29,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 16:00:30,041 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 16:00:30,041 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-12 16:00:30,047 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/de27640b7/ec35e69c855149f393cd683cb8f35c63/FLAG0e3359c8f [2024-09-12 16:00:30,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/de27640b7/ec35e69c855149f393cd683cb8f35c63 [2024-09-12 16:00:30,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 16:00:30,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 16:00:30,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 16:00:30,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 16:00:30,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 16:00:30,069 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3264decd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30, skipping insertion in model container [2024-09-12 16:00:30,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,086 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 16:00:30,224 WARN L247 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_valuebound20.c[712,725] [2024-09-12 16:00:30,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 16:00:30,278 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 16:00:30,290 WARN L247 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_valuebound20.c[712,725] [2024-09-12 16:00:30,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 16:00:30,310 INFO L204 MainTranslator]: Completed translation [2024-09-12 16:00:30,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30 WrapperNode [2024-09-12 16:00:30,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 16:00:30,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 16:00:30,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 16:00:30,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 16:00:30,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,330 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 16:00:30,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 16:00:30,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 16:00:30,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 16:00:30,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 16:00:30,340 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,366 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-12 16:00:30,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,373 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 16:00:30,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 16:00:30,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 16:00:30,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 16:00:30,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (1/1) ... [2024-09-12 16:00:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 16:00:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:00:30,419 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-12 16:00:30,421 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-12 16:00:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 16:00:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 16:00:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 16:00:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 16:00:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 16:00:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 16:00:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 16:00:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 16:00:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 16:00:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 16:00:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 16:00:30,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 16:00:30,508 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 16:00:30,509 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 16:00:30,654 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-12 16:00:30,655 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 16:00:30,680 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 16:00:30,681 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 16:00:30,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:00:30 BoogieIcfgContainer [2024-09-12 16:00:30,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 16:00:30,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 16:00:30,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 16:00:30,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 16:00:30,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 04:00:30" (1/3) ... [2024-09-12 16:00:30,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d8745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 04:00:30, skipping insertion in model container [2024-09-12 16:00:30,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:30" (2/3) ... [2024-09-12 16:00:30,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d8745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 04:00:30, skipping insertion in model container [2024-09-12 16:00:30,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:00:30" (3/3) ... [2024-09-12 16:00:30,691 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2024-09-12 16:00:30,708 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 16:00:30,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 16:00:30,768 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 16:00:30,775 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;@41b485ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 16:00:30,776 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 16:00:30,780 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-12 16:00:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 16:00:30,787 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:00:30,787 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:00:30,788 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:00:30,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:00:30,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-12 16:00:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:00:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202496193] [2024-09-12 16:00:30,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:00:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:00:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:00:30,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 16:00:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:00:30,942 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 16:00:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:00:30,952 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-12 16:00:30,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 16:00:30,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202496193] [2024-09-12 16:00:30,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202496193] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 16:00:30,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 16:00:30,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 16:00:30,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194243266] [2024-09-12 16:00:30,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:00:30,959 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 16:00:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 16:00:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 16:00:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 16:00:30,981 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-12 16:00:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:00:31,003 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-12 16:00:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 16:00:31,006 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-12 16:00:31,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:00:31,013 INFO L225 Difference]: With dead ends: 42 [2024-09-12 16:00:31,014 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 16:00:31,016 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-12 16:00:31,019 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-12 16:00:31,020 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-12 16:00:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 16:00:31,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-12 16:00:31,050 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-12 16:00:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-12 16:00:31,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-12 16:00:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:00:31,056 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-12 16:00:31,056 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-12 16:00:31,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:00:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-12 16:00:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 16:00:31,058 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:00:31,058 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:00:31,058 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 16:00:31,058 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:00:31,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:00:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-12 16:00:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 16:00:31,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977687018] [2024-09-12 16:00:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:00:31,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 16:00:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-12 16:00:31,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-12 16:00:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-12 16:00:31,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-12 16:00:31,121 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-12 16:00:31,122 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 16:00:31,124 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 16:00:31,127 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1] [2024-09-12 16:00:31,142 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 16:00:31,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 04:00:31 BoogieIcfgContainer [2024-09-12 16:00:31,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 16:00:31,149 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 16:00:31,149 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 16:00:31,149 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 16:00:31,150 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:00:30" (3/4) ... [2024-09-12 16:00:31,152 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-09-12 16:00:31,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 16:00:31,153 INFO L158 Benchmark]: Toolchain (without parser) took 1091.13ms. Allocated memory is still 73.4MB. Free memory was 44.3MB in the beginning and 33.8MB in the end (delta: 10.4MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-09-12 16:00:31,154 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 16:00:31,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.27ms. Allocated memory is still 73.4MB. Free memory was 44.1MB in the beginning and 52.3MB in the end (delta: -8.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2024-09-12 16:00:31,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.09ms. Allocated memory is still 73.4MB. Free memory was 52.3MB in the beginning and 51.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 16:00:31,155 INFO L158 Benchmark]: Boogie Preprocessor took 53.33ms. Allocated memory is still 73.4MB. Free memory was 51.3MB in the beginning and 49.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 16:00:31,158 INFO L158 Benchmark]: RCFGBuilder took 296.59ms. Allocated memory is still 73.4MB. Free memory was 49.3MB in the beginning and 38.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 16:00:31,158 INFO L158 Benchmark]: TraceAbstraction took 465.27ms. Allocated memory is still 73.4MB. Free memory was 37.6MB in the beginning and 34.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2024-09-12 16:00:31,159 INFO L158 Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 73.4MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 16:00:31,161 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 28.1MB in the beginning and 28.1MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.27ms. Allocated memory is still 73.4MB. Free memory was 44.1MB in the beginning and 52.3MB in the end (delta: -8.2MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.09ms. Allocated memory is still 73.4MB. Free memory was 52.3MB in the beginning and 51.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.33ms. Allocated memory is still 73.4MB. Free memory was 51.3MB in the beginning and 49.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 296.59ms. Allocated memory is still 73.4MB. Free memory was 49.3MB in the beginning and 38.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 465.27ms. Allocated memory is still 73.4MB. Free memory was 37.6MB in the beginning and 34.2MB in the end (delta: 3.4MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Witness Printer took 3.77ms. Allocated memory is still 73.4MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=20) VAL [\old(cond)=1] [L14] COND FALSE !(!cond) VAL [\old(cond)=1] [L28] RET assume_abort_if_not(a>=0 && a<=20) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0] [L19] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 24 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-09-12 16:00:31,198 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_valuebound20.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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 16:00:33,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 16:00:33,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-12 16:00:33,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 16:00:33,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 16:00:33,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 16:00:33,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 16:00:33,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 16:00:33,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 16:00:33,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 16:00:33,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 16:00:33,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 16:00:33,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 16:00:33,278 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 16:00:33,278 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 16:00:33,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 16:00:33,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 16:00:33,279 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 16:00:33,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 16:00:33,280 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 16:00:33,280 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 16:00:33,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 16:00:33,284 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 16:00:33,285 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-12 16:00:33,285 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-12 16:00:33,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 16:00:33,285 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-12 16:00:33,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 16:00:33,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 16:00:33,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 16:00:33,286 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 16:00:33,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 16:00:33,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 16:00:33,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 16:00:33,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 16:00:33,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 16:00:33,288 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 16:00:33,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 16:00:33,289 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-12 16:00:33,289 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-12 16:00:33,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 16:00:33,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 16:00:33,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 16:00:33,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 16:00:33,290 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-12 16:00:33,291 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a 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 [2024-09-12 16:00:33,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 16:00:33,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 16:00:33,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 16:00:33,612 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 16:00:33,614 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 16:00:33,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-12 16:00:35,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 16:00:35,297 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 16:00:35,298 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2024-09-12 16:00:35,306 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c1ec2947d/8d946d4b62b84667b30ac0ce7f87a311/FLAG5a50ac819 [2024-09-12 16:00:35,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c1ec2947d/8d946d4b62b84667b30ac0ce7f87a311 [2024-09-12 16:00:35,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 16:00:35,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 16:00:35,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 16:00:35,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 16:00:35,326 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 16:00:35,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3e4843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35, skipping insertion in model container [2024-09-12 16:00:35,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,344 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 16:00:35,493 WARN L247 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_valuebound20.c[712,725] [2024-09-12 16:00:35,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 16:00:35,531 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 16:00:35,544 WARN L247 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_valuebound20.c[712,725] [2024-09-12 16:00:35,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 16:00:35,572 INFO L204 MainTranslator]: Completed translation [2024-09-12 16:00:35,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35 WrapperNode [2024-09-12 16:00:35,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 16:00:35,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 16:00:35,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 16:00:35,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 16:00:35,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,596 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 16:00:35,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 16:00:35,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 16:00:35,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 16:00:35,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 16:00:35,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,613 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,625 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-12 16:00:35,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 16:00:35,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 16:00:35,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 16:00:35,651 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 16:00:35,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (1/1) ... [2024-09-12 16:00:35,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 16:00:35,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 16:00:35,688 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-12 16:00:35,697 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-12 16:00:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 16:00:35,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-12 16:00:35,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 16:00:35,739 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 16:00:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 16:00:35,740 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 16:00:35,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 16:00:35,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 16:00:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 16:00:35,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 16:00:35,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 16:00:35,741 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 16:00:35,809 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 16:00:35,811 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 16:00:36,577 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-09-12 16:00:36,578 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 16:00:36,613 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 16:00:36,613 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-12 16:00:36,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:00:36 BoogieIcfgContainer [2024-09-12 16:00:36,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 16:00:36,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 16:00:36,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 16:00:36,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 16:00:36,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 04:00:35" (1/3) ... [2024-09-12 16:00:36,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1553f8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 04:00:36, skipping insertion in model container [2024-09-12 16:00:36,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 04:00:35" (2/3) ... [2024-09-12 16:00:36,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1553f8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 04:00:36, skipping insertion in model container [2024-09-12 16:00:36,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 04:00:36" (3/3) ... [2024-09-12 16:00:36,624 INFO L112 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2024-09-12 16:00:36,639 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 16:00:36,639 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 16:00:36,690 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 16:00:36,697 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;@47d0bf0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 16:00:36,700 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 16:00:36,704 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-12 16:00:36,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 16:00:36,711 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:00:36,711 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:00:36,712 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:00:36,717 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:00:36,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1065431329, now seen corresponding path program 1 times [2024-09-12 16:00:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 16:00:36,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544194253] [2024-09-12 16:00:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:00:36,732 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-12 16:00:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 16:00:36,735 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-12 16:00:36,736 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-12 16:00:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:00:37,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-12 16:00:37,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:00:37,064 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-12 16:00:37,065 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 16:00:37,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 16:00:37,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544194253] [2024-09-12 16:00:37,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544194253] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 16:00:37,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 16:00:37,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 16:00:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947652177] [2024-09-12 16:00:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:00:37,075 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 16:00:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 16:00:37,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 16:00:37,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 16:00:37,103 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-12 16:00:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:00:37,126 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2024-09-12 16:00:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 16:00:37,129 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-12 16:00:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:00:37,135 INFO L225 Difference]: With dead ends: 42 [2024-09-12 16:00:37,135 INFO L226 Difference]: Without dead ends: 21 [2024-09-12 16:00:37,138 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-12 16:00:37,142 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-12 16:00:37,142 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-12 16:00:37,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-09-12 16:00:37,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-09-12 16:00:37,173 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-12 16:00:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-09-12 16:00:37,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2024-09-12 16:00:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:00:37,175 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-09-12 16:00:37,176 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-12 16:00:37,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:00:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-09-12 16:00:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-12 16:00:37,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:00:37,177 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 16:00:37,188 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-12 16:00:37,377 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-12 16:00:37,378 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:00:37,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:00:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash -392820709, now seen corresponding path program 1 times [2024-09-12 16:00:37,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 16:00:37,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631539623] [2024-09-12 16:00:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:00:37,380 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-12 16:00:37,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 16:00:37,383 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-12 16:00:37,384 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-12 16:00:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-12 16:00:37,640 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-12 16:00:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-12 16:00:37,867 ERROR L246 FreeRefinementEngine]: Caught known exception: Invalid model [2024-09-12 16:00:37,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1512751039] [2024-09-12 16:00:37,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:00:37,869 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 16:00:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 16:00:37,882 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-12 16:00:37,884 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-12 16:00:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:00:38,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-12 16:00:38,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:00:58,635 WARN L293 SmtUtils]: Spent 7.97s 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-12 16:01:05,144 WARN L293 SmtUtils]: Spent 6.51s 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-12 16:01:13,257 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-12 16:01:33,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse1) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 v_main_~a~0_BEFORE_CALL_1) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse3)))) (_ bv0 32)))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 v_main_~a~0_BEFORE_CALL_1) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse3)))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse1))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) is different from false [2024-09-12 16:01:43,061 WARN L293 SmtUtils]: Spent 5.74s 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-12 16:01:48,345 WARN L293 SmtUtils]: Spent 5.28s 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-12 16:01:56,474 WARN L293 SmtUtils]: Spent 8.13s 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-12 16:02:06,255 WARN L293 SmtUtils]: Spent 5.73s 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-12 16:02:18,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse3) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 v_main_~a~0_BEFORE_CALL_1) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse2)))) (_ bv0 32)))) (= (_ bv1 32) c___VERIFIER_assert_~cond)))) is different from false [2024-09-12 16:02:34,428 WARN L293 SmtUtils]: Spent 7.16s 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-12 16:02:42,555 WARN L293 SmtUtils]: Spent 8.13s 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-12 16:02:46,586 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 (_ bv20 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from false [2024-09-12 16:02:50,611 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 (_ bv20 32))) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse0)))) is different from true [2024-09-12 16:02:50,612 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-12 16:02:50,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 16:02:50,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 16:02:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631539623] [2024-09-12 16:02:50,612 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-12 16:02:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1512751039] [2024-09-12 16:02:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1512751039] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 16:02:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 16:02:50,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-12 16:02:50,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825099824] [2024-09-12 16:02:50,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 16:02:50,614 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 16:02:50,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 16:02:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 16:02:50,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=39, Unknown=4, NotChecked=42, Total=110 [2024-09-12 16:02:50,615 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-12 16:02:59,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 16:03:03,327 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (or (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse1) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 v_main_~a~0_BEFORE_CALL_1) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse3)))) (_ bv0 32)))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (exists ((v_main_~a~0_BEFORE_CALL_1 (_ FloatingPoint 11 53))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 v_main_~a~0_BEFORE_CALL_1) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~a~0_BEFORE_CALL_1 .cse3)))) (_ bv0 32))) (fp.leq v_main_~a~0_BEFORE_CALL_1 .cse0) (fp.geq v_main_~a~0_BEFORE_CALL_1 .cse1))) (= (_ bv0 32) |c___VERIFIER_assert_#in~cond|)))) (= ((_ sign_extend 24) (_ bv0 8)) (select (select |c_#memory_int#0| (_ bv1 32)) (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2024-09-12 16:03:07,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 16:03:08,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 16:03:12,930 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-12 16:03:15,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 16:03:20,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 16:03:24,096 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-12 16:03:28,099 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-12 16:03:32,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 16:03:36,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 16:03:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 16:03:36,454 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2024-09-12 16:03:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 16:03:36,495 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-12 16:03:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 16:03:36,496 INFO L225 Difference]: With dead ends: 31 [2024-09-12 16:03:36,496 INFO L226 Difference]: Without dead ends: 29 [2024-09-12 16:03:36,497 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=49, Invalid=94, Unknown=5, NotChecked=92, Total=240 [2024-09-12 16:03:36,498 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 8 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 35.4s IncrementalHoareTripleChecker+Time [2024-09-12 16:03:36,498 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 41 Invalid, 6 Unknown, 104 Unchecked, 35.4s Time] [2024-09-12 16:03:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-12 16:03:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-12 16:03:36,506 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-12 16:03:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2024-09-12 16:03:36,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 16 [2024-09-12 16:03:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 16:03:36,508 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2024-09-12 16:03:36,508 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-12 16:03:36,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:03:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2024-09-12 16:03:36,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-12 16:03:36,509 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 16:03:36,509 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-12 16:03:36,531 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-12 16:03:36,721 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-12 16:03:36,913 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-12 16:03:36,914 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 16:03:36,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 16:03:36,915 INFO L85 PathProgramCache]: Analyzing trace with hash -711167633, now seen corresponding path program 1 times [2024-09-12 16:03:36,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 16:03:36,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950489826] [2024-09-12 16:03:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 16:03:36,915 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-12 16:03:36,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 16:03:36,918 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-12 16:03:36,920 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-12 16:03:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 16:03:37,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 16:03:37,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 16:03:45,462 WARN L293 SmtUtils]: Spent 8.14s 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-12 16:03:49,506 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-12 16:03:53,552 WARN L876 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul c_main_~r~0 c_main_~r~0)) c_main_~a~0) ((_ to_fp 11 53) c_currentRoundingMode c_main_~r~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) c_main_~x~0)))) is different from true [2024-09-12 16:04:01,649 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:04:13,815 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:04:17,860 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2024-09-12 16:04:30,037 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:04:34,084 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_main_~r~0_BEFORE_CALL_2 (_ BitVec 32)) (v_main_~a~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~x~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul v_main_~r~0_BEFORE_CALL_2 v_main_~r~0_BEFORE_CALL_2)) v_main_~a~0_BEFORE_CALL_2) ((_ to_fp 11 53) currentRoundingMode v_main_~r~0_BEFORE_CALL_2)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) v_main_~x~0_BEFORE_CALL_2))))) (= (_ bv1 32) c___VERIFIER_assert_~cond)) is different from false [2024-09-12 16:04:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-09-12 16:04:34,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 16:04:42,300 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:04:50,395 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-09-12 16:05:06,704 WARN L293 SmtUtils]: Spent 16.26s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition)