./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 de325976 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-de32597-m [2024-09-17 18:30:58,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:30:58,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-17 18:30:58,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:30:58,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:30:58,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:30:58,713 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:30:58,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:30:58,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:30:58,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:30:58,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:30:58,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:30:58,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:30:58,716 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:30:58,716 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:30:58,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:30:58,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:30:58,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:30:58,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-17 18:30:58,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:30:58,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:30:58,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:30:58,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:30:58,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:30:58,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:30:58,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:30:58,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:30:58,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:30:58,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:30:58,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:30:58,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:30:58,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:30:58,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:30:58,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:30:58,724 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:30:58,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:30:58,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-17 18:30:58,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-17 18:30:58,725 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:30:58,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:30:58,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:30:58,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:30:58,726 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-17 18:30:59,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:30:59,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:30:59,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:30:59,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:30:59,037 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:30:59,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-17 18:31:00,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:31:00,701 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:31:00,701 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-17 18:31:00,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d69c4bfbe/09d95d86bf0d42b39e5ca9fc268e1098/FLAG0f12693ad [2024-09-17 18:31:00,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d69c4bfbe/09d95d86bf0d42b39e5ca9fc268e1098 [2024-09-17 18:31:00,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:31:00,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:31:00,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:00,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:31:00,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:31:00,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:00" (1/1) ... [2024-09-17 18:31:00,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59a2e845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:00, skipping insertion in model container [2024-09-17 18:31:00,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:00" (1/1) ... [2024-09-17 18:31:00,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:31:00,923 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-17 18:31:00,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:00,962 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:31:00,978 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-17 18:31:00,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:01,006 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:31:01,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01 WrapperNode [2024-09-17 18:31:01,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:01,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:01,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:31:01,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:31:01,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,034 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:31:01,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:01,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:31:01,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:31:01,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:31:01,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,063 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-17 18:31:01,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,071 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:31:01,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:31:01,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:31:01,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:31:01,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (1/1) ... [2024-09-17 18:31:01,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:31:01,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:31:01,105 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-17 18:31:01,107 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-17 18:31:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:31:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 18:31:01,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 18:31:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:31:01,146 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:31:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-17 18:31:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-17 18:31:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:31:01,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:31:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-17 18:31:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:31:01,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:31:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-17 18:31:01,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-17 18:31:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-17 18:31:01,148 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-17 18:31:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 18:31:01,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 18:31:01,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-17 18:31:01,222 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:31:01,225 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:31:01,376 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-17 18:31:01,376 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:31:01,393 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:31:01,394 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-17 18:31:01,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:01 BoogieIcfgContainer [2024-09-17 18:31:01,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:31:01,397 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:31:01,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:31:01,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:31:01,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:31:00" (1/3) ... [2024-09-17 18:31:01,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49643a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:01, skipping insertion in model container [2024-09-17 18:31:01,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:01" (2/3) ... [2024-09-17 18:31:01,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49643a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:01, skipping insertion in model container [2024-09-17 18:31:01,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:01" (3/3) ... [2024-09-17 18:31:01,408 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-17 18:31:01,441 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:31:01,443 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:31:01,523 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:31:01,530 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;@647c76a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:31:01,530 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:31:01,534 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-17 18:31:01,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-17 18:31:01,541 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:01,542 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-17 18:31:01,543 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:01,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:01,550 INFO L85 PathProgramCache]: Analyzing trace with hash 346667744, now seen corresponding path program 1 times [2024-09-17 18:31:01,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:01,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802260982] [2024-09-17 18:31:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:01,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:01,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:01,731 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:01,757 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:01,769 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:31:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:01,776 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-17 18:31:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802260982] [2024-09-17 18:31:01,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802260982] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:01,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-17 18:31:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086372111] [2024-09-17 18:31:01,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:01,784 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-17 18:31:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-17 18:31:01,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-17 18:31:01,805 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-17 18:31:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:01,897 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-09-17 18:31:01,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-17 18:31:01,899 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-17 18:31:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:01,906 INFO L225 Difference]: With dead ends: 64 [2024-09-17 18:31:01,906 INFO L226 Difference]: Without dead ends: 31 [2024-09-17 18:31:01,910 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-17 18:31:01,915 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-17 18:31:01,916 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-17 18:31:01,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-17 18:31:01,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-17 18:31:01,954 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-17 18:31:01,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-17 18:31:01,958 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2024-09-17 18:31:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:01,958 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-17 18:31:01,959 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-17 18:31:01,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-17 18:31:01,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-17 18:31:01,963 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:01,963 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-17 18:31:01,963 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-17 18:31:01,964 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:01,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1280327332, now seen corresponding path program 1 times [2024-09-17 18:31:01,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519300973] [2024-09-17 18:31:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,452 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,486 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:31:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,499 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-17 18:31:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519300973] [2024-09-17 18:31:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519300973] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:02,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:02,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-17 18:31:02,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831898746] [2024-09-17 18:31:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:02,504 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-17 18:31:02,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-17 18:31:02,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-17 18:31:02,508 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-17 18:31:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:02,696 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-09-17 18:31:02,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 18:31:02,697 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-17 18:31:02,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:02,698 INFO L225 Difference]: With dead ends: 37 [2024-09-17 18:31:02,698 INFO L226 Difference]: Without dead ends: 35 [2024-09-17 18:31:02,699 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-17 18:31:02,700 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.1s IncrementalHoareTripleChecker+Time [2024-09-17 18:31:02,700 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.1s Time] [2024-09-17 18:31:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-17 18:31:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-17 18:31:02,707 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-17 18:31:02,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-17 18:31:02,709 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2024-09-17 18:31:02,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:02,711 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-17 18:31:02,711 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-17 18:31:02,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:02,712 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-17 18:31:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-17 18:31:02,713 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:02,713 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-17 18:31:02,713 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-17 18:31:02,713 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:02,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:02,714 INFO L85 PathProgramCache]: Analyzing trace with hash 824482951, now seen corresponding path program 1 times [2024-09-17 18:31:02,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-17 18:31:02,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113679256] [2024-09-17 18:31:02,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:02,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-17 18:31:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-17 18:31:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:02,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-17 18:31:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-17 18:31:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-17 18:31:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-17 18:31:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:03,038 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-17 18:31:03,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-17 18:31:03,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113679256] [2024-09-17 18:31:03,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113679256] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:03,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:03,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-17 18:31:03,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67232370] [2024-09-17 18:31:03,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:03,041 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-17 18:31:03,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-17 18:31:03,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-17 18:31:03,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-17 18:31:03,043 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-17 18:31:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:03,231 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-09-17 18:31:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-17 18:31:03,231 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-17 18:31:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:03,232 INFO L225 Difference]: With dead ends: 35 [2024-09-17 18:31:03,232 INFO L226 Difference]: Without dead ends: 0 [2024-09-17 18:31:03,233 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-17 18:31:03,236 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-17 18:31:03,236 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-17 18:31:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-17 18:31:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-17 18:31:03,237 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-17 18:31:03,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-17 18:31:03,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-17 18:31:03,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:03,238 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-17 18:31:03,238 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-17 18:31:03,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-17 18:31:03,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-17 18:31:03,241 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-17 18:31:03,242 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-17 18:31:03,245 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-17 18:31:03,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-17 18:31:03,328 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-17 18:31:03,337 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-17 18:31:03,339 INFO L158 Benchmark]: Toolchain (without parser) took 2609.42ms. Allocated memory is still 167.8MB. Free memory was 97.4MB in the beginning and 83.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2024-09-17 18:31:03,340 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:31:03,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.58ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 85.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-17 18:31:03,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.19ms. Allocated memory is still 167.8MB. Free memory was 85.5MB in the beginning and 84.6MB in the end (delta: 921.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:31:03,341 INFO L158 Benchmark]: Boogie Preprocessor took 40.40ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-17 18:31:03,341 INFO L158 Benchmark]: RCFGBuilder took 318.01ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 67.5MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-09-17 18:31:03,341 INFO L158 Benchmark]: TraceAbstraction took 1942.11ms. Allocated memory is still 167.8MB. Free memory was 66.8MB in the beginning and 83.0MB in the end (delta: -16.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-17 18:31:03,347 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 121.6MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.58ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 85.5MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.19ms. Allocated memory is still 167.8MB. Free memory was 85.5MB in the beginning and 84.6MB in the end (delta: 921.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.40ms. Allocated memory is still 167.8MB. Free memory was 84.6MB in the beginning and 82.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 318.01ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 67.5MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1942.11ms. Allocated memory is still 167.8MB. Free memory was 66.8MB in the beginning and 83.0MB in the end (delta: -16.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.3s 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-17 18:31:03,379 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-de32597-m [2024-09-17 18:31:05,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-17 18:31:05,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-17 18:31:05,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-17 18:31:05,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-17 18:31:05,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-17 18:31:05,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-17 18:31:05,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-17 18:31:05,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-17 18:31:05,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-17 18:31:05,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-17 18:31:05,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-17 18:31:05,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-17 18:31:05,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-17 18:31:05,617 INFO L153 SettingsManager]: * Use SBE=true [2024-09-17 18:31:05,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-17 18:31:05,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-17 18:31:05,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-17 18:31:05,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-17 18:31:05,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-17 18:31:05,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-17 18:31:05,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-17 18:31:05,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-17 18:31:05,620 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-17 18:31:05,620 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-17 18:31:05,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-17 18:31:05,620 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-17 18:31:05,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-17 18:31:05,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-17 18:31:05,621 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-17 18:31:05,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-17 18:31:05,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-17 18:31:05,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-17 18:31:05,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-17 18:31:05,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:31:05,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-17 18:31:05,623 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-17 18:31:05,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-17 18:31:05,624 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-17 18:31:05,624 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-17 18:31:05,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-17 18:31:05,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-17 18:31:05,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-17 18:31:05,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-17 18:31:05,626 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-17 18:31:05,626 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-17 18:31:05,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-17 18:31:05,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-17 18:31:05,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-17 18:31:05,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-17 18:31:05,972 INFO L274 PluginConnector]: CDTParser initialized [2024-09-17 18:31:05,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-17 18:31:07,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-17 18:31:07,710 INFO L384 CDTParser]: Found 1 translation units. [2024-09-17 18:31:07,710 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-17 18:31:07,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/805c87a47/708b47fb7e2543109e50d38f5d889162/FLAG79837e63e [2024-09-17 18:31:07,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/805c87a47/708b47fb7e2543109e50d38f5d889162 [2024-09-17 18:31:07,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-17 18:31:07,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-17 18:31:07,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:07,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-17 18:31:07,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-17 18:31:07,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:07" (1/1) ... [2024-09-17 18:31:07,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2392db77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:07, skipping insertion in model container [2024-09-17 18:31:07,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 06:31:07" (1/1) ... [2024-09-17 18:31:07,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-17 18:31:07,917 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-17 18:31:07,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:07,974 INFO L200 MainTranslator]: Completed pre-run [2024-09-17 18:31:07,986 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-17 18:31:07,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-17 18:31:08,019 INFO L204 MainTranslator]: Completed translation [2024-09-17 18:31:08,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08 WrapperNode [2024-09-17 18:31:08,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-17 18:31:08,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:08,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-17 18:31:08,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-17 18:31:08,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,045 INFO L138 Inliner]: procedures = 20, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-17 18:31:08,046 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-17 18:31:08,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-17 18:31:08,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-17 18:31:08,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-17 18:31:08,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,079 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-17 18:31:08,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,079 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-17 18:31:08,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-17 18:31:08,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-17 18:31:08,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-17 18:31:08,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (1/1) ... [2024-09-17 18:31:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-17 18:31:08,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-17 18:31:08,146 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-17 18:31:08,153 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-17 18:31:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-17 18:31:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-17 18:31:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-17 18:31:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-17 18:31:08,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-17 18:31:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-17 18:31:08,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-17 18:31:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-17 18:31:08,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-17 18:31:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-17 18:31:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-17 18:31:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-17 18:31:08,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-17 18:31:08,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-17 18:31:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-17 18:31:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-17 18:31:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-17 18:31:08,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-17 18:31:08,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-17 18:31:08,293 INFO L242 CfgBuilder]: Building ICFG [2024-09-17 18:31:08,299 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-17 18:31:08,529 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-17 18:31:08,530 INFO L291 CfgBuilder]: Performing block encoding [2024-09-17 18:31:08,566 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-17 18:31:08,570 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-17 18:31:08,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:08 BoogieIcfgContainer [2024-09-17 18:31:08,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-17 18:31:08,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-17 18:31:08,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-17 18:31:08,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-17 18:31:08,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.09 06:31:07" (1/3) ... [2024-09-17 18:31:08,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369645df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:08, skipping insertion in model container [2024-09-17 18:31:08,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 06:31:08" (2/3) ... [2024-09-17 18:31:08,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369645df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.09 06:31:08, skipping insertion in model container [2024-09-17 18:31:08,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 06:31:08" (3/3) ... [2024-09-17 18:31:08,581 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-17 18:31:08,597 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-17 18:31:08,598 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-17 18:31:08,669 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-17 18:31:08,677 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;@a789234, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-17 18:31:08,678 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-17 18:31:08,683 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-17 18:31:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-17 18:31:08,691 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:08,692 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-17 18:31:08,693 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:08,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 346667744, now seen corresponding path program 1 times [2024-09-17 18:31:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:08,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739006036] [2024-09-17 18:31:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:08,712 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-17 18:31:08,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:08,716 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-17 18:31:08,717 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-17 18:31:08,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:08,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-17 18:31:08,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:08,824 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-17 18:31:08,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:31:08,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739006036] [2024-09-17 18:31:08,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739006036] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:08,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:08,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-17 18:31:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592899103] [2024-09-17 18:31:08,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:08,831 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-17 18:31:08,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:08,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-17 18:31:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-17 18:31:08,856 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-17 18:31:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:08,885 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-09-17 18:31:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-17 18:31:08,888 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-17 18:31:08,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:08,894 INFO L225 Difference]: With dead ends: 64 [2024-09-17 18:31:08,894 INFO L226 Difference]: Without dead ends: 31 [2024-09-17 18:31:08,897 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-17 18:31:08,901 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-17 18:31:08,901 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-17 18:31:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-17 18:31:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-17 18:31:08,934 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-17 18:31:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-17 18:31:08,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2024-09-17 18:31:08,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:08,940 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-17 18:31:08,940 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-17 18:31:08,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-17 18:31:08,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-17 18:31:08,943 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:08,943 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-17 18:31:08,949 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-17 18:31:09,145 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-17 18:31:09,146 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:09,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1280327332, now seen corresponding path program 1 times [2024-09-17 18:31:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624410320] [2024-09-17 18:31:09,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:09,148 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-17 18:31:09,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:09,151 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-17 18:31:09,152 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-17 18:31:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:09,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-17 18:31:09,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:09,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-17 18:31:09,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-17 18:31:09,727 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-17 18:31:09,820 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-17 18:31:09,821 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:31:09,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:09,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624410320] [2024-09-17 18:31:09,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624410320] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:09,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-17 18:31:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191929123] [2024-09-17 18:31:09,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:09,824 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-17 18:31:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:09,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-17 18:31:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-17 18:31:09,827 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-17 18:31:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:10,227 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-09-17 18:31:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-17 18:31:10,228 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-17 18:31:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:10,230 INFO L225 Difference]: With dead ends: 50 [2024-09-17 18:31:10,230 INFO L226 Difference]: Without dead ends: 48 [2024-09-17 18:31:10,231 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-17 18:31:10,232 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-17 18:31:10,233 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-17 18:31:10,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-17 18:31:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2024-09-17 18:31:10,246 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-17 18:31:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-09-17 18:31:10,248 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 27 [2024-09-17 18:31:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:10,248 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-09-17 18:31:10,249 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-17 18:31:10,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-09-17 18:31:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-17 18:31:10,250 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:10,251 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-17 18:31:10,255 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-17 18:31:10,451 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-17 18:31:10,452 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:10,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:10,452 INFO L85 PathProgramCache]: Analyzing trace with hash 624891711, now seen corresponding path program 1 times [2024-09-17 18:31:10,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:10,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079786044] [2024-09-17 18:31:10,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:10,453 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-17 18:31:10,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:10,455 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-17 18:31:10,456 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-17 18:31:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:10,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-17 18:31:10,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:11,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-17 18:31:11,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-17 18:31:11,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-17 18:31:11,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-17 18:31:11,493 INFO L349 Elim1Store]: treesize reduction 54, result has 42.6 percent of original size [2024-09-17 18:31:11,494 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-17 18:31:11,672 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-17 18:31:11,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:31:11,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079786044] [2024-09-17 18:31:11,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079786044] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-17 18:31:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2130067331] [2024-09-17 18:31:11,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:11,932 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-17 18:31:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-17 18:31:11,934 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-17 18:31:11,935 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-17 18:31:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:12,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-17 18:31:12,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:12,077 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-17 18:31:20,966 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-17 18:31:21,103 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-17 18:31:21,204 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-17 18:31:21,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:31:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2130067331] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:21,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-17 18:31:21,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 22 [2024-09-17 18:31:21,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548696359] [2024-09-17 18:31:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:21,205 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-17 18:31:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:21,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-17 18:31:21,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=532, Unknown=2, NotChecked=46, Total=650 [2024-09-17 18:31:21,206 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-17 18:31:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:21,410 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-09-17 18:31:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-17 18:31:21,411 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-17 18:31:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:21,414 INFO L225 Difference]: With dead ends: 50 [2024-09-17 18:31:21,414 INFO L226 Difference]: Without dead ends: 48 [2024-09-17 18:31:21,414 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-17 18:31:21,416 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-17 18:31:21,416 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-17 18:31:21,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-17 18:31:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2024-09-17 18:31:21,426 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-17 18:31:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-17 18:31:21,427 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2024-09-17 18:31:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:21,427 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-17 18:31:21,427 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-17 18:31:21,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-17 18:31:21,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-17 18:31:21,429 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:21,429 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-17 18:31:21,432 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-17 18:31:21,634 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-09-17 18:31:21,832 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-17 18:31:21,832 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:21,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:21,833 INFO L85 PathProgramCache]: Analyzing trace with hash 824482951, now seen corresponding path program 1 times [2024-09-17 18:31:21,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:21,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237060245] [2024-09-17 18:31:21,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:21,834 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-17 18:31:21,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:21,836 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-17 18:31:21,837 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-17 18:31:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:21,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-17 18:31:21,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:21,927 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-17 18:31:21,963 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-17 18:31:21,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-17 18:31:21,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237060245] [2024-09-17 18:31:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237060245] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-17 18:31:21,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-17 18:31:21,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-17 18:31:21,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613220233] [2024-09-17 18:31:21,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-17 18:31:21,965 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-17 18:31:21,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:21,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-17 18:31:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-17 18:31:21,966 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-17 18:31:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:22,116 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-17 18:31:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-17 18:31:22,117 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-17 18:31:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:22,118 INFO L225 Difference]: With dead ends: 58 [2024-09-17 18:31:22,119 INFO L226 Difference]: Without dead ends: 56 [2024-09-17 18:31:22,120 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-17 18:31:22,121 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-17 18:31:22,124 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-17 18:31:22,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-17 18:31:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-09-17 18:31:22,143 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-17 18:31:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-09-17 18:31:22,144 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 34 [2024-09-17 18:31:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:22,144 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-09-17 18:31:22,144 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-17 18:31:22,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:22,145 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-09-17 18:31:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-17 18:31:22,146 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:22,146 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-17 18:31:22,152 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-17 18:31:22,348 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-17 18:31:22,349 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:22,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1857654460, now seen corresponding path program 1 times [2024-09-17 18:31:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:22,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030041193] [2024-09-17 18:31:22,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:22,351 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-17 18:31:22,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:22,354 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-17 18:31:22,354 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-17 18:31:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:22,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-17 18:31:22,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:23,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-17 18:31:23,259 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-17 18:31:23,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-17 18:31:23,263 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-17 18:31:23,370 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-17 18:31:23,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:31:23,903 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2024-09-17 18:31:23,904 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-17 18:31:24,038 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-17 18:31:24,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:31:24,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030041193] [2024-09-17 18:31:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030041193] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:31:24,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:31:24,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2024-09-17 18:31:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364726582] [2024-09-17 18:31:24,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 18:31:24,040 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-17 18:31:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:31:24,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-17 18:31:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-17 18:31:24,041 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-17 18:31:28,160 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-17 18:31:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-17 18:31:31,545 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-09-17 18:31:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-17 18:31:31,546 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-17 18:31:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-17 18:31:31,548 INFO L225 Difference]: With dead ends: 90 [2024-09-17 18:31:31,548 INFO L226 Difference]: Without dead ends: 88 [2024-09-17 18:31:31,549 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-17 18:31:31,550 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 112 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.5s IncrementalHoareTripleChecker+Time [2024-09-17 18:31:31,550 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.5s Time] [2024-09-17 18:31:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-17 18:31:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2024-09-17 18:31:31,574 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-17 18:31:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-09-17 18:31:31,577 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 36 [2024-09-17 18:31:31,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-17 18:31:31,577 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-09-17 18:31:31,578 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-17 18:31:31,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:31,578 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-09-17 18:31:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-17 18:31:31,579 INFO L208 NwaCegarLoop]: Found error trace [2024-09-17 18:31:31,579 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-17 18:31:31,587 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-09-17 18:31:31,780 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-17 18:31:31,780 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-17 18:31:31,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-17 18:31:31,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1065990015, now seen corresponding path program 1 times [2024-09-17 18:31:31,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-17 18:31:31,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831143106] [2024-09-17 18:31:31,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-17 18:31:31,781 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-17 18:31:31,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-17 18:31:31,784 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-17 18:31:31,785 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-17 18:31:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-17 18:31:31,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-17 18:31:31,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-17 18:31:53,253 INFO L349 Elim1Store]: treesize reduction 16, result has 92.8 percent of original size [2024-09-17 18:31:53,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 225 [2024-09-17 18:31:53,714 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-17 18:31:53,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-17 18:32:06,801 INFO L349 Elim1Store]: treesize reduction 25, result has 62.7 percent of original size [2024-09-17 18:32:06,802 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-17 18:32:15,075 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-17 18:32:15,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-17 18:32:15,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831143106] [2024-09-17 18:32:15,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831143106] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-17 18:32:15,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-17 18:32:15,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-09-17 18:32:15,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166251799] [2024-09-17 18:32:15,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-17 18:32:15,078 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-17 18:32:15,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-17 18:32:15,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-17 18:32:15,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=389, Unknown=8, NotChecked=0, Total=462 [2024-09-17 18:32:15,082 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 20 states have internal predecessors, (41), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-17 18:32:19,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-17 18:32:23,414 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-17 18:32:27,482 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-17 18:32:31,536 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-17 18:32:35,616 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-17 18:32:43,821 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-17 18:32:47,889 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-17 18:32:51,918 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-17 18:32:55,986 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-17 18:33:00,003 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-17 18:33:04,060 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-17 18:33:08,081 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-17 18:33:16,376 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-17 18:33:20,401 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-17 18:33:41,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-17 18:33:59,906 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-17 18:34:12,137 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-17 18:34:16,775 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-17 18:34:20,846 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-17 18:34:24,932 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-17 18:34:29,052 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-17 18:34:33,066 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-17 18:34:37,078 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-17 18:34:53,466 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-17 18:34:56,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 18:35:00,474 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-17 18:35:03,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-17 18:35:08,137 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-17 18:35:12,297 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-17 18:35:16,452 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]