./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 27b49876 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/verifythis/elimination_max.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 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-27b4987-m [2024-09-21 11:38:57,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 11:38:57,471 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-21 11:38:57,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 11:38:57,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 11:38:57,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 11:38:57,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 11:38:57,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 11:38:57,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 11:38:57,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 11:38:57,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 11:38:57,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 11:38:57,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 11:38:57,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 11:38:57,514 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 11:38:57,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 11:38:57,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 11:38:57,515 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 11:38:57,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-21 11:38:57,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 11:38:57,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 11:38:57,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 11:38:57,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 11:38:57,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 11:38:57,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 11:38:57,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 11:38:57,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 11:38:57,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 11:38:57,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 11:38:57,523 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 11:38:57,523 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 11:38:57,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 11:38:57,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:38:57,524 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 11:38:57,524 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 11:38:57,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 11:38:57,525 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-21 11:38:57,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-21 11:38:57,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 11:38:57,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 11:38:57,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 11:38:57,528 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 11:38:57,535 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 -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-21 11:38:57,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 11:38:57,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 11:38:57,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 11:38:57,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 11:38:57,808 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 11:38:57,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-21 11:38:59,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 11:38:59,409 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 11:38:59,410 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-21 11:38:59,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5f0a1a49a/0677979e12354f948661a44ac0623b9a/FLAG75088e86e [2024-09-21 11:38:59,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5f0a1a49a/0677979e12354f948661a44ac0623b9a [2024-09-21 11:38:59,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 11:38:59,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 11:38:59,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 11:38:59,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 11:38:59,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 11:38:59,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40fefc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59, skipping insertion in model container [2024-09-21 11:38:59,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 11:38:59,635 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-21 11:38:59,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:38:59,673 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 11:38:59,689 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-21 11:38:59,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:38:59,730 INFO L204 MainTranslator]: Completed translation [2024-09-21 11:38:59,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59 WrapperNode [2024-09-21 11:38:59,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 11:38:59,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 11:38:59,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 11:38:59,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 11:38:59,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,752 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 11:38:59,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 11:38:59,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 11:38:59,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 11:38:59,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 11:38:59,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,781 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-21 11:38:59,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,791 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 11:38:59,804 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 11:38:59,804 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 11:38:59,804 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 11:38:59,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (1/1) ... [2024-09-21 11:38:59,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:38:59,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:38:59,838 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-21 11:38:59,841 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-21 11:38:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 11:38:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-21 11:38:59,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-21 11:38:59,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 11:38:59,888 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 11:38:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-21 11:38:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-21 11:38:59,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 11:38:59,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 11:38:59,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-21 11:38:59,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 11:38:59,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 11:38:59,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-21 11:38:59,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-21 11:38:59,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-21 11:38:59,890 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-21 11:38:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 11:38:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 11:38:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-21 11:38:59,961 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 11:38:59,964 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 11:39:00,118 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-21 11:39:00,119 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 11:39:00,144 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 11:39:00,144 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-21 11:39:00,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:39:00 BoogieIcfgContainer [2024-09-21 11:39:00,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 11:39:00,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 11:39:00,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 11:39:00,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 11:39:00,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:38:59" (1/3) ... [2024-09-21 11:39:00,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0f9bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:39:00, skipping insertion in model container [2024-09-21 11:39:00,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:38:59" (2/3) ... [2024-09-21 11:39:00,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0f9bab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:39:00, skipping insertion in model container [2024-09-21 11:39:00,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:39:00" (3/3) ... [2024-09-21 11:39:00,153 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-21 11:39:00,169 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 11:39:00,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 11:39:00,230 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 11:39:00,240 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;@979e0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 11:39:00,241 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 11:39:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-21 11:39:00,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-21 11:39:00,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:00,258 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:00,259 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:00,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash 346667744, now seen corresponding path program 1 times [2024-09-21 11:39:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:39:00,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768908124] [2024-09-21 11:39:00,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:39:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:00,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:39:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:00,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 11:39:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:00,460 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-21 11:39:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:00,480 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-21 11:39:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 11:39:00,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:39:00,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768908124] [2024-09-21 11:39:00,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768908124] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:39:00,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:39:00,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-21 11:39:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837704686] [2024-09-21 11:39:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:39:00,494 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-21 11:39:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:39:00,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-21 11:39:00,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:39:00,517 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:39:00,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:00,629 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-09-21 11:39:00,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-21 11:39:00,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-21 11:39:00,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:00,637 INFO L225 Difference]: With dead ends: 64 [2024-09-21 11:39:00,638 INFO L226 Difference]: Without dead ends: 31 [2024-09-21 11:39:00,641 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-21 11:39:00,646 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:00,648 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 11:39:00,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-21 11:39:00,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-21 11:39:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-21 11:39:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-21 11:39:00,680 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2024-09-21 11:39:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:00,681 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-21 11:39:00,681 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:39:00,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:00,682 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-21 11:39:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-21 11:39:00,683 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:00,684 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:00,684 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-21 11:39:00,684 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:00,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:00,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1280327332, now seen corresponding path program 1 times [2024-09-21 11:39:00,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:39:00,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700267828] [2024-09-21 11:39:00,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:00,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:39:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:39:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 11:39:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,175 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-21 11:39:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-21 11:39:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 11:39:01,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:39:01,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700267828] [2024-09-21 11:39:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700267828] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:39:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:39:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-21 11:39:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224964307] [2024-09-21 11:39:01,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:39:01,221 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-21 11:39:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:39:01,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-21 11:39:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-21 11:39:01,224 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:39:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:01,439 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-09-21 11:39:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-21 11:39:01,440 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-09-21 11:39:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:01,441 INFO L225 Difference]: With dead ends: 37 [2024-09-21 11:39:01,441 INFO L226 Difference]: Without dead ends: 35 [2024-09-21 11:39:01,441 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-09-21 11:39:01,442 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 31 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:01,443 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 80 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-21 11:39:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-21 11:39:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-21 11:39:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-21 11:39:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-21 11:39:01,457 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2024-09-21 11:39:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:01,459 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-21 11:39:01,460 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:39:01,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:01,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-21 11:39:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-21 11:39:01,461 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:01,462 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:01,462 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-21 11:39:01,462 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:01,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 824482951, now seen corresponding path program 1 times [2024-09-21 11:39:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-21 11:39:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641688893] [2024-09-21 11:39:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-21 11:39:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,772 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-21 11:39:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-21 11:39:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-21 11:39:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-21 11:39:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-21 11:39:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 11:39:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-21 11:39:01,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641688893] [2024-09-21 11:39:01,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641688893] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:39:01,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:39:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-21 11:39:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339456446] [2024-09-21 11:39:01,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:39:01,823 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-21 11:39:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-21 11:39:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-21 11:39:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-21 11:39:01,825 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-21 11:39:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:02,005 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-09-21 11:39:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-21 11:39:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2024-09-21 11:39:02,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:02,006 INFO L225 Difference]: With dead ends: 35 [2024-09-21 11:39:02,006 INFO L226 Difference]: Without dead ends: 0 [2024-09-21 11:39:02,007 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-09-21 11:39:02,009 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:02,010 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 89 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 11:39:02,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-21 11:39:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-21 11:39:02,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-21 11:39:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-21 11:39:02,012 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-21 11:39:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:02,013 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-21 11:39:02,013 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-21 11:39:02,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-21 11:39:02,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-21 11:39:02,015 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-21 11:39:02,016 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-21 11:39:02,019 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-21 11:39:02,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-21 11:39:02,106 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-21 11:39:02,119 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.lib.translation.DefaultTranslator.translateExpressionWithContext(DefaultTranslator.java:165) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContext(ModelTranslationContainer.java:101) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionWithContextToString(ModelTranslationContainer.java:91) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.BacktranslationService.translateExpressionWithContextToString(BacktranslationService.java:98) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.(InvariantResult.java:57) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createInvariantResults(FloydHoareUtils.java:116) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-09-21 11:39:02,123 INFO L158 Benchmark]: Toolchain (without parser) took 2681.33ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 66.6MB in the beginning and 93.6MB in the end (delta: -27.1MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-09-21 11:39:02,124 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:39:02,124 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.72ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 66.6MB in the beginning and 123.8MB in the end (delta: -57.2MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-09-21 11:39:02,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.89ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 122.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-21 11:39:02,125 INFO L158 Benchmark]: Boogie Preprocessor took 50.07ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-21 11:39:02,125 INFO L158 Benchmark]: RCFGBuilder took 341.04ms. Allocated memory is still 151.0MB. Free memory was 120.3MB in the beginning and 106.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-21 11:39:02,125 INFO L158 Benchmark]: TraceAbstraction took 1976.05ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 93.6MB in the end (delta: 12.0MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-09-21 11:39:02,130 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.17ms. Allocated memory is still 121.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.72ms. Allocated memory was 121.6MB in the beginning and 151.0MB in the end (delta: 29.4MB). Free memory was 66.6MB in the beginning and 123.8MB in the end (delta: -57.2MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.89ms. Allocated memory is still 151.0MB. Free memory was 123.8MB in the beginning and 122.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.07ms. Allocated memory is still 151.0MB. Free memory was 122.4MB in the beginning and 120.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 341.04ms. Allocated memory is still 151.0MB. Free memory was 120.3MB in the beginning and 106.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1976.05ms. Allocated memory is still 151.0MB. Free memory was 105.6MB in the beginning and 93.6MB in the end (delta: 12.0MB). Peak memory consumption was 13.0MB. 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 - PositiveResult [Line: 11]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 56 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 14/14 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-21 11:39:02,161 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/verifythis/elimination_max.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 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-27b4987-m [2024-09-21 11:39:04,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-21 11:39:04,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-21 11:39:04,333 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-21 11:39:04,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-21 11:39:04,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-21 11:39:04,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-21 11:39:04,369 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-21 11:39:04,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-21 11:39:04,369 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-21 11:39:04,370 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-21 11:39:04,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-21 11:39:04,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-21 11:39:04,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-21 11:39:04,372 INFO L153 SettingsManager]: * Use SBE=true [2024-09-21 11:39:04,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-21 11:39:04,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-21 11:39:04,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-21 11:39:04,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-21 11:39:04,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-21 11:39:04,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-21 11:39:04,378 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-21 11:39:04,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-21 11:39:04,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-21 11:39:04,378 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-21 11:39:04,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-21 11:39:04,379 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-21 11:39:04,379 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-21 11:39:04,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-21 11:39:04,379 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-21 11:39:04,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-21 11:39:04,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-21 11:39:04,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-21 11:39:04,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-21 11:39:04,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:39:04,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-21 11:39:04,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-21 11:39:04,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-21 11:39:04,382 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-21 11:39:04,383 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-21 11:39:04,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-21 11:39:04,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-21 11:39:04,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-21 11:39:04,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-21 11:39:04,384 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-21 11:39:04,385 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 -> 0bc7b1b837bfd7794f122f6504da8d835bb2276ae4afe0cc0d058d385032d49e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-21 11:39:04,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-21 11:39:04,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-21 11:39:04,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-21 11:39:04,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-21 11:39:04,724 INFO L274 PluginConnector]: CDTParser initialized [2024-09-21 11:39:04,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-21 11:39:06,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-21 11:39:06,454 INFO L384 CDTParser]: Found 1 translation units. [2024-09-21 11:39:06,454 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-21 11:39:06,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/70e73d92e/42fbc4e051174223959b2c3888eb7986/FLAG0bda176ab [2024-09-21 11:39:06,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/70e73d92e/42fbc4e051174223959b2c3888eb7986 [2024-09-21 11:39:06,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-21 11:39:06,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-21 11:39:06,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-21 11:39:06,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-21 11:39:06,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-21 11:39:06,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c5640b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06, skipping insertion in model container [2024-09-21 11:39:06,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-21 11:39:06,673 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-21 11:39:06,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:39:06,715 INFO L200 MainTranslator]: Completed pre-run [2024-09-21 11:39:06,730 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-21 11:39:06,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-21 11:39:06,762 INFO L204 MainTranslator]: Completed translation [2024-09-21 11:39:06,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06 WrapperNode [2024-09-21 11:39:06,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-21 11:39:06,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-21 11:39:06,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-21 11:39:06,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-21 11:39:06,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,785 INFO L138 Inliner]: procedures = 20, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-21 11:39:06,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-21 11:39:06,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-21 11:39:06,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-21 11:39:06,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-21 11:39:06,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,820 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-09-21 11:39:06,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,845 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-21 11:39:06,862 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-21 11:39:06,862 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-21 11:39:06,862 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-21 11:39:06,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (1/1) ... [2024-09-21 11:39:06,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-21 11:39:06,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-21 11:39:06,901 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-21 11:39:06,904 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-21 11:39:06,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-21 11:39:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-21 11:39:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-21 11:39:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-21 11:39:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-21 11:39:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-21 11:39:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-21 11:39:06,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-21 11:39:06,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-21 11:39:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-21 11:39:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-21 11:39:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-21 11:39:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-21 11:39:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-21 11:39:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-21 11:39:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-21 11:39:06,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-21 11:39:06,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-21 11:39:06,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-21 11:39:07,022 INFO L242 CfgBuilder]: Building ICFG [2024-09-21 11:39:07,024 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-21 11:39:07,236 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-21 11:39:07,237 INFO L291 CfgBuilder]: Performing block encoding [2024-09-21 11:39:07,272 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-21 11:39:07,275 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-21 11:39:07,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:39:07 BoogieIcfgContainer [2024-09-21 11:39:07,276 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-21 11:39:07,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-21 11:39:07,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-21 11:39:07,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-21 11:39:07,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.09 11:39:06" (1/3) ... [2024-09-21 11:39:07,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d10a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:39:07, skipping insertion in model container [2024-09-21 11:39:07,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.09 11:39:06" (2/3) ... [2024-09-21 11:39:07,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d10a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.09 11:39:07, skipping insertion in model container [2024-09-21 11:39:07,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.09 11:39:07" (3/3) ... [2024-09-21 11:39:07,286 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-21 11:39:07,301 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-21 11:39:07,302 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-21 11:39:07,365 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-21 11:39:07,374 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;@488455a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-21 11:39:07,378 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-21 11:39:07,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-21 11:39:07,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-21 11:39:07,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:07,392 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:07,393 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:07,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash 346667744, now seen corresponding path program 1 times [2024-09-21 11:39:07,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-21 11:39:07,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508699699] [2024-09-21 11:39:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:07,416 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-21 11:39:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-21 11:39:07,419 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-21 11:39:07,421 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-21 11:39:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:07,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-21 11:39:07,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:39:07,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-21 11:39:07,550 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 11:39:07,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-21 11:39:07,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508699699] [2024-09-21 11:39:07,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508699699] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:39:07,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:39:07,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-21 11:39:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861270590] [2024-09-21 11:39:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:39:07,556 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-21 11:39:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-21 11:39:07,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-21 11:39:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-21 11:39:07,583 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-21 11:39:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:07,620 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-09-21 11:39:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-21 11:39:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 27 [2024-09-21 11:39:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:07,632 INFO L225 Difference]: With dead ends: 64 [2024-09-21 11:39:07,632 INFO L226 Difference]: Without dead ends: 31 [2024-09-21 11:39:07,635 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-21 11:39:07,641 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:07,642 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-21 11:39:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-21 11:39:07,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-21 11:39:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-21 11:39:07,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-21 11:39:07,671 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2024-09-21 11:39:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:07,672 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-21 11:39:07,672 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-21 11:39:07,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:07,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-21 11:39:07,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-21 11:39:07,676 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:07,676 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:07,679 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-21 11:39:07,877 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-21 11:39:07,878 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:07,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:07,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1280327332, now seen corresponding path program 1 times [2024-09-21 11:39:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-21 11:39:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007494499] [2024-09-21 11:39:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:07,879 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-21 11:39:07,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-21 11:39:07,882 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-21 11:39:07,882 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-21 11:39:07,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:07,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-21 11:39:07,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:39:08,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-21 11:39:08,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-21 11:39:08,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2024-09-21 11:39:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 11:39:08,488 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 11:39:08,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-21 11:39:08,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007494499] [2024-09-21 11:39:08,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007494499] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:39:08,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:39:08,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-21 11:39:08,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617529506] [2024-09-21 11:39:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:39:08,492 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-21 11:39:08,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-21 11:39:08,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-21 11:39:08,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-21 11:39:08,493 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-21 11:39:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:08,874 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-09-21 11:39:08,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-21 11:39:08,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-09-21 11:39:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:08,877 INFO L225 Difference]: With dead ends: 50 [2024-09-21 11:39:08,877 INFO L226 Difference]: Without dead ends: 48 [2024-09-21 11:39:08,877 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-09-21 11:39:08,878 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:08,879 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 204 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-21 11:39:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-21 11:39:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2024-09-21 11:39:08,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.16) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-21 11:39:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-09-21 11:39:08,900 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 27 [2024-09-21 11:39:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:08,900 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-09-21 11:39:08,900 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 9 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-21 11:39:08,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:08,901 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-09-21 11:39:08,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-21 11:39:08,903 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:08,903 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:08,907 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 (3)] Ended with exit code 0 [2024-09-21 11:39:09,106 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 [2024-09-21 11:39:09,107 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:09,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash 624891711, now seen corresponding path program 1 times [2024-09-21 11:39:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-21 11:39:09,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616689911] [2024-09-21 11:39:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:09,109 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-21 11:39:09,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-21 11:39:09,112 INFO L229 MonitoredProcess]: Starting monitored process 4 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-21 11:39:09,112 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 (4)] Waiting until timeout for monitored process [2024-09-21 11:39:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:09,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-21 11:39:09,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:39:09,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-21 11:39:09,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-21 11:39:09,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-21 11:39:09,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-21 11:39:09,974 INFO L349 Elim1Store]: treesize reduction 54, result has 42.6 percent of original size [2024-09-21 11:39:09,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 47 treesize of output 52 [2024-09-21 11:39:10,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:39:10,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:39:10,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-21 11:39:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616689911] [2024-09-21 11:39:10,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616689911] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-21 11:39:10,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [235846285] [2024-09-21 11:39:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-21 11:39:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-21 11:39:10,424 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-21 11:39:10,426 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-09-21 11:39:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:10,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-21 11:39:10,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:39:10,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-21 11:39:19,427 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_main_~a~0.base_BEFORE_CALL_2 (_ BitVec 32))) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)) (select |c_#memory_int#1| v_main_~a~0.base_BEFORE_CALL_2))) is different from true [2024-09-21 11:39:19,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-09-21 11:39:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-21 11:39:19,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 11:39:19,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [235846285] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:39:19,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-21 11:39:19,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 22 [2024-09-21 11:39:19,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322782138] [2024-09-21 11:39:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:39:19,721 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-21 11:39:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-21 11:39:19,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-21 11:39:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=532, Unknown=2, NotChecked=46, Total=650 [2024-09-21 11:39:19,722 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:39:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:19,935 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-09-21 11:39:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-21 11:39:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2024-09-21 11:39:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:19,938 INFO L225 Difference]: With dead ends: 50 [2024-09-21 11:39:19,938 INFO L226 Difference]: Without dead ends: 48 [2024-09-21 11:39:19,939 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=84, Invalid=620, Unknown=2, NotChecked=50, Total=756 [2024-09-21 11:39:19,940 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:19,941 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 142 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 61 Unchecked, 0.1s Time] [2024-09-21 11:39:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-21 11:39:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2024-09-21 11:39:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-21 11:39:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-21 11:39:19,959 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2024-09-21 11:39:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:19,959 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-21 11:39:19,959 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-21 11:39:19,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-21 11:39:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-21 11:39:19,962 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:19,963 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:19,968 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 (4)] Ended with exit code 0 [2024-09-21 11:39:20,166 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-09-21 11:39:20,363 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-21 11:39:20,364 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:20,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash 824482951, now seen corresponding path program 1 times [2024-09-21 11:39:20,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-21 11:39:20,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093141144] [2024-09-21 11:39:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:20,365 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-21 11:39:20,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-21 11:39:20,367 INFO L229 MonitoredProcess]: Starting monitored process 6 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-21 11:39:20,368 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 (6)] Waiting until timeout for monitored process [2024-09-21 11:39:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:20,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-21 11:39:20,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:39:20,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-21 11:39:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 11:39:20,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-21 11:39:20,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-21 11:39:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093141144] [2024-09-21 11:39:20,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093141144] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-21 11:39:20,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-21 11:39:20,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-21 11:39:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621960368] [2024-09-21 11:39:20,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-21 11:39:20,515 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-21 11:39:20,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-21 11:39:20,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-21 11:39:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-21 11:39:20,517 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-21 11:39:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:20,692 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-21 11:39:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-21 11:39:20,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2024-09-21 11:39:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:20,694 INFO L225 Difference]: With dead ends: 58 [2024-09-21 11:39:20,696 INFO L226 Difference]: Without dead ends: 56 [2024-09-21 11:39:20,696 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-21 11:39:20,697 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:20,697 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 130 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-21 11:39:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-21 11:39:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-09-21 11:39:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-21 11:39:20,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-09-21 11:39:20,721 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 34 [2024-09-21 11:39:20,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:20,721 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-09-21 11:39:20,722 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-21 11:39:20,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:20,722 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-09-21 11:39:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-21 11:39:20,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:20,723 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:20,729 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 (6)] Ended with exit code 0 [2024-09-21 11:39:20,924 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-21 11:39:20,925 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:20,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1857654460, now seen corresponding path program 1 times [2024-09-21 11:39:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-21 11:39:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031529855] [2024-09-21 11:39:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:20,926 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-21 11:39:20,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-21 11:39:20,929 INFO L229 MonitoredProcess]: Starting monitored process 7 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-21 11:39:20,930 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 (7)] Waiting until timeout for monitored process [2024-09-21 11:39:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:20,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-21 11:39:20,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:39:21,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-21 11:39:21,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-21 11:39:21,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-21 11:39:21,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 13 [2024-09-21 11:39:22,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:39:22,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:39:22,635 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2024-09-21 11:39:22,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 24 [2024-09-21 11:39:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 11:39:22,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-21 11:39:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031529855] [2024-09-21 11:39:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031529855] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:39:22,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-21 11:39:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2024-09-21 11:39:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603736165] [2024-09-21 11:39:22,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-21 11:39:22,789 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-21 11:39:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-21 11:39:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-21 11:39:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-21 11:39:22,791 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 19 states have internal predecessors, (41), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-21 11:39:26,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:39:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-21 11:39:30,045 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-09-21 11:39:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-21 11:39:30,046 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 19 states have internal predecessors, (41), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 36 [2024-09-21 11:39:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-21 11:39:30,048 INFO L225 Difference]: With dead ends: 90 [2024-09-21 11:39:30,048 INFO L226 Difference]: Without dead ends: 88 [2024-09-21 11:39:30,049 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2024-09-21 11:39:30,050 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 112 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-09-21 11:39:30,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 325 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 492 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-09-21 11:39:30,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-21 11:39:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2024-09-21 11:39:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.163265306122449) internal successors, (57), 51 states have internal predecessors, (57), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-21 11:39:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-09-21 11:39:30,076 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 36 [2024-09-21 11:39:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-21 11:39:30,076 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-09-21 11:39:30,077 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 19 states have internal predecessors, (41), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-21 11:39:30,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-09-21 11:39:30,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-21 11:39:30,078 INFO L208 NwaCegarLoop]: Found error trace [2024-09-21 11:39:30,079 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-21 11:39:30,084 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 (7)] Ended with exit code 0 [2024-09-21 11:39:30,281 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-21 11:39:30,282 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-21 11:39:30,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-21 11:39:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1065990015, now seen corresponding path program 1 times [2024-09-21 11:39:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-21 11:39:30,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052739241] [2024-09-21 11:39:30,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-21 11:39:30,283 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-21 11:39:30,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-21 11:39:30,285 INFO L229 MonitoredProcess]: Starting monitored process 8 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-21 11:39:30,285 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 (8)] Waiting until timeout for monitored process [2024-09-21 11:39:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-21 11:39:30,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-21 11:39:30,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-21 11:40:16,872 INFO L349 Elim1Store]: treesize reduction 32, result has 97.0 percent of original size [2024-09-21 11:40:16,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 159 treesize of output 1067 [2024-09-21 11:40:37,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-21 11:40:37,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-21 11:41:02,762 INFO L349 Elim1Store]: treesize reduction 25, result has 62.7 percent of original size [2024-09-21 11:41:02,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 52 [2024-09-21 11:41:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-21 11:41:10,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-21 11:41:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052739241] [2024-09-21 11:41:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052739241] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-21 11:41:10,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-21 11:41:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-09-21 11:41:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536163762] [2024-09-21 11:41:10,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-21 11:41:10,919 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-21 11:41:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-21 11:41:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-21 11:41:10,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=455, Unknown=18, NotChecked=0, Total=552 [2024-09-21 11:41:10,921 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 21 states have internal predecessors, (41), 6 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-21 11:41:14,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:18,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:23,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:27,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:31,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:35,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:39,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:43,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:55,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:41:59,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:03,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:07,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:11,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:15,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:19,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:23,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:27,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:31,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:35,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:39,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:43,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:42:47,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:43:08,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:43:12,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:43:16,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:43:20,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-21 11:43:24,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-21 11:43:28,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]