./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 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 22:58:14,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 22:58:14,078 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 22:58:14,084 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 22:58:14,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 22:58:14,126 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 22:58:14,127 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 22:58:14,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 22:58:14,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 22:58:14,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 22:58:14,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 22:58:14,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 22:58:14,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 22:58:14,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 22:58:14,131 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 22:58:14,131 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 22:58:14,131 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 22:58:14,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 22:58:14,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 22:58:14,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 22:58:14,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 22:58:14,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 22:58:14,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 22:58:14,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 22:58:14,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 22:58:14,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 22:58:14,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 22:58:14,135 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 22:58:14,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 22:58:14,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 22:58:14,136 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 22:58:14,136 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 22:58:14,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:58:14,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 22:58:14,137 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 22:58:14,137 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 22:58:14,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 22:58:14,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 22:58:14,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 22:58:14,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 22:58:14,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 22:58:14,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 22:58:14,141 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 [2024-09-12 22:58:14,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 22:58:14,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 22:58:14,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 22:58:14,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 22:58:14,407 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 22:58:14,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 22:58:15,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 22:58:15,992 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 22:58:15,993 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 22:58:16,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fed785f12/f945efbd026f49aba5ef3f152d5de851/FLAG157636424 [2024-09-12 22:58:16,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fed785f12/f945efbd026f49aba5ef3f152d5de851 [2024-09-12 22:58:16,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 22:58:16,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 22:58:16,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 22:58:16,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 22:58:16,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 22:58:16,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef40407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16, skipping insertion in model container [2024-09-12 22:58:16,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 22:58:16,552 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 22:58:16,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:58:16,577 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 22:58:16,589 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 22:58:16,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:58:16,610 INFO L204 MainTranslator]: Completed translation [2024-09-12 22:58:16,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16 WrapperNode [2024-09-12 22:58:16,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 22:58:16,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 22:58:16,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 22:58:16,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 22:58:16,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,629 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,640 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 22:58:16,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 22:58:16,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 22:58:16,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 22:58:16,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 22:58:16,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,672 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-12 22:58:16,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,691 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 22:58:16,693 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 22:58:16,694 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 22:58:16,694 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 22:58:16,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (1/1) ... [2024-09-12 22:58:16,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:58:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:58:16,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 22:58:16,733 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 22:58:16,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 22:58:16,782 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 22:58:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 22:58:16,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 22:58:16,783 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 22:58:16,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 22:58:16,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 22:58:16,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 22:58:16,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 22:58:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 22:58:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 22:58:16,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 22:58:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 22:58:16,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 22:58:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 22:58:16,786 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 22:58:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 22:58:16,786 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 22:58:16,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 22:58:16,861 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 22:58:16,863 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 22:58:17,025 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-12 22:58:17,025 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 22:58:17,045 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 22:58:17,045 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 22:58:17,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:58:17 BoogieIcfgContainer [2024-09-12 22:58:17,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 22:58:17,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 22:58:17,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 22:58:17,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 22:58:17,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 10:58:16" (1/3) ... [2024-09-12 22:58:17,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc0cd73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:58:17, skipping insertion in model container [2024-09-12 22:58:17,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:16" (2/3) ... [2024-09-12 22:58:17,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc0cd73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:58:17, skipping insertion in model container [2024-09-12 22:58:17,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:58:17" (3/3) ... [2024-09-12 22:58:17,058 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-12 22:58:17,082 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 22:58:17,082 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 22:58:17,138 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 22:58:17,144 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;@79f65604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 22:58:17,145 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 22:58:17,150 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-12 22:58:17,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 22:58:17,158 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:17,159 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-12 22:58:17,159 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:17,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash 346667744, now seen corresponding path program 1 times [2024-09-12 22:58:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653856725] [2024-09-12 22:58:17,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:17,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,401 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 22:58:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:17,426 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-12 22:58:17,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653856725] [2024-09-12 22:58:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653856725] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:17,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:17,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 22:58:17,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432623230] [2024-09-12 22:58:17,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:17,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 22:58:17,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 22:58:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 22:58:17,466 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-12 22:58:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:17,566 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-09-12 22:58:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 22:58:17,569 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-12 22:58:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:17,575 INFO L225 Difference]: With dead ends: 64 [2024-09-12 22:58:17,575 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 22:58:17,578 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-12 22:58:17,583 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-12 22:58:17,585 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-12 22:58:17,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 22:58:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-12 22:58:17,638 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-12 22:58:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-12 22:58:17,657 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2024-09-12 22:58:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:17,658 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-12 22:58:17,659 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-12 22:58:17,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-12 22:58:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 22:58:17,667 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:17,667 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-12 22:58:17,667 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 22:58:17,671 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:17,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:17,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1280327332, now seen corresponding path program 1 times [2024-09-12 22:58:17,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:17,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784539114] [2024-09-12 22:58:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,115 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,133 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 22:58:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,181 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-12 22:58:18,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:18,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784539114] [2024-09-12 22:58:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784539114] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:18,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:18,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-12 22:58:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298402298] [2024-09-12 22:58:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:18,186 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 22:58:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:18,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 22:58:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-12 22:58:18,190 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-12 22:58:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:18,380 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-09-12 22:58:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 22:58:18,381 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-12 22:58:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:18,382 INFO L225 Difference]: With dead ends: 37 [2024-09-12 22:58:18,382 INFO L226 Difference]: Without dead ends: 35 [2024-09-12 22:58:18,384 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-12 22:58:18,386 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-12 22:58:18,386 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-12 22:58:18,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-12 22:58:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-12 22:58:18,395 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-12 22:58:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-12 22:58:18,396 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2024-09-12 22:58:18,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:18,397 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-12 22:58:18,397 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-12 22:58:18,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-12 22:58:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 22:58:18,399 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:18,399 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-12 22:58:18,400 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 22:58:18,400 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:18,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:18,402 INFO L85 PathProgramCache]: Analyzing trace with hash 824482951, now seen corresponding path program 1 times [2024-09-12 22:58:18,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 22:58:18,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859681981] [2024-09-12 22:58:18,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 22:58:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,702 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 22:58:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,709 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 22:58:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-12 22:58:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,758 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-12 22:58:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-12 22:58:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:18,771 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-12 22:58:18,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 22:58:18,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859681981] [2024-09-12 22:58:18,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859681981] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:18,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-09-12 22:58:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050236168] [2024-09-12 22:58:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:18,775 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 22:58:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 22:58:18,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 22:58:18,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-09-12 22:58:18,777 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-12 22:58:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:18,964 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2024-09-12 22:58:18,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 22:58:18,965 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-12 22:58:18,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:18,966 INFO L225 Difference]: With dead ends: 35 [2024-09-12 22:58:18,966 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 22:58:18,967 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-12 22:58:18,969 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-12 22:58:18,970 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-12 22:58:18,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 22:58:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 22:58:18,972 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-12 22:58:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 22:58:18,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2024-09-12 22:58:18,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:18,973 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 22:58:18,973 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-12 22:58:18,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:18,974 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 22:58:18,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 22:58:18,978 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-12 22:58:18,978 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 22:58:18,981 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-09-12 22:58:18,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 22:58:19,072 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 22:58:19,081 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-12 22:58:19,086 INFO L158 Benchmark]: Toolchain (without parser) took 2693.16ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 145.1MB in the beginning and 159.6MB in the end (delta: -14.4MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2024-09-12 22:58:19,086 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 22:58:19,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 217.27ms. Allocated memory is still 174.1MB. Free memory was 144.9MB in the beginning and 136.7MB in the end (delta: 8.2MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-09-12 22:58:19,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.03ms. Allocated memory is still 174.1MB. Free memory was 136.7MB in the beginning and 135.9MB in the end (delta: 761.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 22:58:19,087 INFO L158 Benchmark]: Boogie Preprocessor took 51.31ms. Allocated memory is still 174.1MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 22:58:19,087 INFO L158 Benchmark]: RCFGBuilder took 352.51ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 119.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-12 22:58:19,087 INFO L158 Benchmark]: TraceAbstraction took 2033.53ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 118.6MB in the beginning and 159.6MB in the end (delta: -41.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 22:58:19,091 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 101.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 217.27ms. Allocated memory is still 174.1MB. Free memory was 144.9MB in the beginning and 136.7MB in the end (delta: 8.2MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.03ms. Allocated memory is still 174.1MB. Free memory was 136.7MB in the beginning and 135.9MB in the end (delta: 761.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.31ms. Allocated memory is still 174.1MB. Free memory was 135.9MB in the beginning and 133.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 352.51ms. Allocated memory is still 174.1MB. Free memory was 133.8MB in the beginning and 119.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2033.53ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 118.6MB in the beginning and 159.6MB in the end (delta: -41.0MB). 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.9s, 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.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 56 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-09-12 22:58:19,122 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 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-5189fb6-m [2024-09-12 22:58:21,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 22:58:21,318 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-12 22:58:21,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 22:58:21,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 22:58:21,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 22:58:21,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 22:58:21,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 22:58:21,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 22:58:21,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 22:58:21,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 22:58:21,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 22:58:21,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 22:58:21,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 22:58:21,367 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 22:58:21,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 22:58:21,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 22:58:21,368 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 22:58:21,368 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 22:58:21,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 22:58:21,368 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 22:58:21,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 22:58:21,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 22:58:21,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-12 22:58:21,370 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-12 22:58:21,370 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 22:58:21,371 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-12 22:58:21,371 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 22:58:21,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 22:58:21,371 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 22:58:21,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 22:58:21,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 22:58:21,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 22:58:21,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 22:58:21,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:58:21,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 22:58:21,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 22:58:21,374 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 22:58:21,375 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-12 22:58:21,375 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-12 22:58:21,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 22:58:21,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 22:58:21,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 22:58:21,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 22:58:21,376 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-12 22:58:21,376 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 [2024-09-12 22:58:21,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 22:58:21,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 22:58:21,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 22:58:21,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 22:58:21,717 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 22:58:21,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 22:58:23,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 22:58:23,456 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 22:58:23,457 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c [2024-09-12 22:58:23,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/58fc7d200/024d42455aa340118f8c9196df0947cd/FLAG320fe428a [2024-09-12 22:58:23,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/58fc7d200/024d42455aa340118f8c9196df0947cd [2024-09-12 22:58:23,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 22:58:23,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 22:58:23,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 22:58:23,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 22:58:23,494 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 22:58:23,495 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45245102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23, skipping insertion in model container [2024-09-12 22:58:23,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 22:58:23,684 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 22:58:23,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:58:23,727 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 22:58:23,737 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max.c[485,498] [2024-09-12 22:58:23,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 22:58:23,769 INFO L204 MainTranslator]: Completed translation [2024-09-12 22:58:23,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23 WrapperNode [2024-09-12 22:58:23,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 22:58:23,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 22:58:23,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 22:58:23,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 22:58:23,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,792 INFO L138 Inliner]: procedures = 20, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 22:58:23,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 22:58:23,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 22:58:23,793 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 22:58:23,793 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 22:58:23,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,822 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-12 22:58:23,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,837 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,841 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 22:58:23,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 22:58:23,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 22:58:23,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 22:58:23,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (1/1) ... [2024-09-12 22:58:23,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 22:58:23,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 22:58:23,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 22:58:23,884 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 22:58:23,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 22:58:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-12 22:58:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-12 22:58:23,926 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-12 22:58:23,926 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-12 22:58:23,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 22:58:23,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 22:58:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 22:58:23,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 22:58:23,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-12 22:58:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-12 22:58:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-12 22:58:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 22:58:23,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 22:58:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-12 22:58:23,929 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-12 22:58:23,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 22:58:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 22:58:23,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 22:58:24,024 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 22:58:24,029 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 22:58:24,258 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-09-12 22:58:24,260 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 22:58:24,292 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 22:58:24,292 INFO L318 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-12 22:58:24,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:58:24 BoogieIcfgContainer [2024-09-12 22:58:24,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 22:58:24,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 22:58:24,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 22:58:24,303 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 22:58:24,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 10:58:23" (1/3) ... [2024-09-12 22:58:24,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45da5b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:58:24, skipping insertion in model container [2024-09-12 22:58:24,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 10:58:23" (2/3) ... [2024-09-12 22:58:24,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45da5b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 10:58:24, skipping insertion in model container [2024-09-12 22:58:24,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 10:58:24" (3/3) ... [2024-09-12 22:58:24,305 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max.c [2024-09-12 22:58:24,321 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 22:58:24,322 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-12 22:58:24,379 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 22:58:24,386 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;@2c5098b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 22:58:24,387 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-12 22:58:24,390 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-12 22:58:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 22:58:24,397 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:24,397 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-12 22:58:24,399 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:24,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:24,406 INFO L85 PathProgramCache]: Analyzing trace with hash 346667744, now seen corresponding path program 1 times [2024-09-12 22:58:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 22:58:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607468584] [2024-09-12 22:58:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:24,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 22:58:24,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 22:58:24,429 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 22:58:24,430 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-12 22:58:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:24,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-12 22:58:24,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:24,546 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-12 22:58:24,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 22:58:24,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 22:58:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607468584] [2024-09-12 22:58:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607468584] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:24,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:24,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 22:58:24,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607934661] [2024-09-12 22:58:24,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:24,552 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-12 22:58:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 22:58:24,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-12 22:58:24,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-12 22:58:24,572 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-12 22:58:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:24,597 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2024-09-12 22:58:24,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-12 22:58:24,600 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-12 22:58:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:24,608 INFO L225 Difference]: With dead ends: 64 [2024-09-12 22:58:24,608 INFO L226 Difference]: Without dead ends: 31 [2024-09-12 22:58:24,611 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-12 22:58:24,613 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-12 22:58:24,614 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-12 22:58:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-12 22:58:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-12 22:58:24,640 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-12 22:58:24,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-12 22:58:24,643 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 27 [2024-09-12 22:58:24,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:24,644 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-12 22:58:24,644 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-12 22:58:24,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:24,645 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-12 22:58:24,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 22:58:24,646 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:24,646 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-12 22:58:24,650 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-12 22:58:24,849 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 22:58:24,850 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:24,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:24,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1280327332, now seen corresponding path program 1 times [2024-09-12 22:58:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 22:58:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404255982] [2024-09-12 22:58:24,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:24,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 22:58:24,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 22:58:24,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 22:58:24,855 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-12 22:58:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:24,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 22:58:24,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:25,326 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 22:58:25,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 22:58:25,335 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-12 22:58:25,427 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-12 22:58:25,427 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 22:58:25,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 22:58:25,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404255982] [2024-09-12 22:58:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404255982] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:25,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:25,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-09-12 22:58:25,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153879980] [2024-09-12 22:58:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:25,430 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 22:58:25,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 22:58:25,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 22:58:25,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-09-12 22:58:25,433 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-12 22:58:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:25,809 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-09-12 22:58:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 22:58:25,810 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-12 22:58:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:25,813 INFO L225 Difference]: With dead ends: 50 [2024-09-12 22:58:25,813 INFO L226 Difference]: Without dead ends: 48 [2024-09-12 22:58:25,813 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-09-12 22:58:25,814 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-12 22:58:25,815 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-12 22:58:25,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-12 22:58:25,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2024-09-12 22:58:25,836 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-12 22:58:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-09-12 22:58:25,838 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 27 [2024-09-12 22:58:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:25,839 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-09-12 22:58:25,839 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-12 22:58:25,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-09-12 22:58:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 22:58:25,841 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:25,842 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-12 22:58:25,846 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-09-12 22:58:26,042 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-12 22:58:26,043 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:26,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:26,043 INFO L85 PathProgramCache]: Analyzing trace with hash 624891711, now seen corresponding path program 1 times [2024-09-12 22:58:26,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 22:58:26,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137351727] [2024-09-12 22:58:26,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:26,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 22:58:26,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 22:58:26,046 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-12 22:58:26,048 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-12 22:58:26,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:26,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 22:58:26,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:26,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 22:58:26,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 22:58:26,889 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 22:58:26,890 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 22:58:26,972 INFO L349 Elim1Store]: treesize reduction 54, result has 42.6 percent of original size [2024-09-12 22:58:26,972 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-12 22:58:27,129 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-12 22:58:27,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:58:27,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 22:58:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137351727] [2024-09-12 22:58:27,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137351727] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 22:58:27,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [673110493] [2024-09-12 22:58:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:27,367 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 22:58:27,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 22:58:27,374 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-12 22:58:27,379 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-12 22:58:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:27,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-12 22:58:27,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:27,501 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-12 22:58:38,117 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-12 22:58:38,497 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-12 22:58:38,589 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-12 22:58:38,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 22:58:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [673110493] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:38,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 22:58:38,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 22 [2024-09-12 22:58:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693693457] [2024-09-12 22:58:38,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:38,591 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 22:58:38,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 22:58:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 22:58:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=532, Unknown=2, NotChecked=46, Total=650 [2024-09-12 22:58:38,593 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-12 22:58:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:38,792 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2024-09-12 22:58:38,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 22:58:38,793 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-12 22:58:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:38,795 INFO L225 Difference]: With dead ends: 50 [2024-09-12 22:58:38,795 INFO L226 Difference]: Without dead ends: 48 [2024-09-12 22:58:38,796 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=84, Invalid=620, Unknown=2, NotChecked=50, Total=756 [2024-09-12 22:58:38,797 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-12 22:58:38,797 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-12 22:58:38,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-12 22:58:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2024-09-12 22:58:38,806 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-12 22:58:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-09-12 22:58:38,807 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 29 [2024-09-12 22:58:38,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:38,807 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-09-12 22:58:38,808 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-12 22:58:38,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-09-12 22:58:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 22:58:38,809 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:38,809 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-12 22:58:38,813 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-12 22:58:39,012 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-09-12 22:58:39,210 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-12 22:58:39,210 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:39,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash 824482951, now seen corresponding path program 1 times [2024-09-12 22:58:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 22:58:39,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245710369] [2024-09-12 22:58:39,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:39,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 22:58:39,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 22:58:39,213 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-12 22:58:39,214 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-12 22:58:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:39,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 22:58:39,260 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:39,313 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-12 22:58:39,358 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-12 22:58:39,358 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 22:58:39,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 22:58:39,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245710369] [2024-09-12 22:58:39,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245710369] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 22:58:39,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 22:58:39,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 22:58:39,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910818946] [2024-09-12 22:58:39,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 22:58:39,360 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 22:58:39,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 22:58:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 22:58:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 22:58:39,360 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-12 22:58:39,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:39,522 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2024-09-12 22:58:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 22:58:39,522 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-12 22:58:39,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:39,524 INFO L225 Difference]: With dead ends: 58 [2024-09-12 22:58:39,524 INFO L226 Difference]: Without dead ends: 56 [2024-09-12 22:58:39,524 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-12 22:58:39,525 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-12 22:58:39,526 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-12 22:58:39,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-12 22:58:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2024-09-12 22:58:39,541 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-12 22:58:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2024-09-12 22:58:39,547 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 34 [2024-09-12 22:58:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:39,547 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2024-09-12 22:58:39,547 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-12 22:58:39,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2024-09-12 22:58:39,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 22:58:39,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:39,549 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-12 22:58:39,555 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-12 22:58:39,752 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-12 22:58:39,752 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:39,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1857654460, now seen corresponding path program 1 times [2024-09-12 22:58:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 22:58:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701671132] [2024-09-12 22:58:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:39,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 22:58:39,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 22:58:39,756 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-12 22:58:39,757 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-12 22:58:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:39,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 22:58:39,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:58:40,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 22:58:40,786 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 22:58:40,791 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 22:58:40,792 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-12 22:58:40,892 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-12 22:58:40,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:58:41,386 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2024-09-12 22:58:41,386 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-12 22:58:41,553 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-12 22:58:41,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 22:58:41,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701671132] [2024-09-12 22:58:41,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701671132] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:58:41,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 22:58:41,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2024-09-12 22:58:41,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398409266] [2024-09-12 22:58:41,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 22:58:41,555 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 22:58:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 22:58:41,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 22:58:41,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-12 22:58:41,560 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-12 22:58:45,699 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-12 22:58:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 22:58:48,709 INFO L93 Difference]: Finished difference Result 90 states and 108 transitions. [2024-09-12 22:58:48,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-12 22:58:48,710 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-12 22:58:48,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 22:58:48,712 INFO L225 Difference]: With dead ends: 90 [2024-09-12 22:58:48,712 INFO L226 Difference]: Without dead ends: 88 [2024-09-12 22:58:48,713 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 22:58:48,713 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 112 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 49 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-09-12 22:58:48,714 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.3s Time] [2024-09-12 22:58:48,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-12 22:58:48,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2024-09-12 22:58:48,745 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-12 22:58:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2024-09-12 22:58:48,749 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 36 [2024-09-12 22:58:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 22:58:48,750 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2024-09-12 22:58:48,750 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-12 22:58:48,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2024-09-12 22:58:48,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-12 22:58:48,751 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 22:58:48,751 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-12 22:58:48,756 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-12 22:58:48,952 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-12 22:58:48,952 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 22:58:48,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 22:58:48,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1065990015, now seen corresponding path program 1 times [2024-09-12 22:58:48,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 22:58:48,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572566555] [2024-09-12 22:58:48,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 22:58:48,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 22:58:48,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 22:58:48,956 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-12 22:58:48,957 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-12 22:58:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 22:58:48,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-12 22:58:49,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 22:59:10,233 INFO L349 Elim1Store]: treesize reduction 16, result has 92.8 percent of original size [2024-09-12 22:59:10,234 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-12 22:59:10,672 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-12 22:59:10,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 22:59:23,546 INFO L349 Elim1Store]: treesize reduction 25, result has 62.7 percent of original size [2024-09-12 22:59:23,548 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-12 22:59:31,733 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-12 22:59:31,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 22:59:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572566555] [2024-09-12 22:59:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572566555] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 22:59:31,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 22:59:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-09-12 22:59:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310507105] [2024-09-12 22:59:31,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 22:59:31,735 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 22:59:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 22:59:31,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 22:59:31,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=389, Unknown=8, NotChecked=0, Total=462 [2024-09-12 22:59:31,736 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-12 22:59:35,743 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-12 22:59:39,881 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-12 22:59:43,925 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-12 22:59:47,958 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-12 22:59:52,004 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-12 23:00:00,242 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-12 23:00:04,338 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-12 23:00:08,355 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-12 23:00:12,411 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-12 23:00:16,433 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-12 23:00:20,508 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-12 23:00:24,530 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-12 23:00:36,843 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-12 23:00:40,865 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-12 23:00:44,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 23:00:49,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 23:00:53,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 23:00:57,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 23:01:05,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-09-12 23:01:14,087 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, 1] [2024-09-12 23:01:18,102 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, 1] [2024-09-12 23:01:30,747 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-12 23:01:35,410 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-12 23:01:39,744 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-12 23:01:44,204 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-12 23:01:48,217 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-12 23:01:52,228 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-12 23:02:04,539 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-12 23:02:08,605 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-12 23:02:12,689 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-12 23:02:16,714 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-12 23:02:20,779 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-12 23:02:24,828 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-12 23:02:28,847 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-12 23:02:32,873 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-12 23:02:36,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 23:02:49,394 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-12 23:02:53,412 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-12 23:02:57,432 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-12 23:02:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:02:57,461 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2024-09-12 23:02:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 23:02:57,463 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 38 [2024-09-12 23:02:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:02:57,465 INFO L225 Difference]: With dead ends: 124 [2024-09-12 23:02:57,465 INFO L226 Difference]: Without dead ends: 122 [2024-09-12 23:02:57,465 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 88.0s TimeCoverageRelationStatistics Valid=175, Invalid=1066, Unknown=19, NotChecked=0, Total=1260 [2024-09-12 23:02:57,466 INFO L434 NwaCegarLoop]: 38 mSDtfsCounter, 50 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 20 mSolverCounterUnsat, 39 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 158.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 39 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 159.1s IncrementalHoareTripleChecker+Time [2024-09-12 23:02:57,466 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 475 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 433 Invalid, 39 Unknown, 0 Unchecked, 159.1s Time] [2024-09-12 23:02:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-12 23:02:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 91. [2024-09-12 23:02:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 65 states have internal predecessors, (75), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:02:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2024-09-12 23:02:57,497 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 38 [2024-09-12 23:02:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:02:57,497 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2024-09-12 23:02:57,497 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has 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-12 23:02:57,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:02:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2024-09-12 23:02:57,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 23:02:57,499 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:02:57,500 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 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] [2024-09-12 23:02:57,504 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 (8)] Ended with exit code 0 [2024-09-12 23:02:57,700 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 23:02:57,700 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:02:57,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:02:57,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1015328908, now seen corresponding path program 1 times [2024-09-12 23:02:57,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 23:02:57,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369294607] [2024-09-12 23:02:57,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 23:02:57,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 23:02:57,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 23:02:57,702 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 23:02:57,703 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 (9)] Waiting until timeout for monitored process [2024-09-12 23:02:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 23:02:57,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 23:02:57,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:02:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 23:02:58,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:02:59,578 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 23:02:59,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 23:02:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369294607] [2024-09-12 23:02:59,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369294607] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:02:59,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:02:59,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2024-09-12 23:02:59,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007834259] [2024-09-12 23:02:59,579 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:02:59,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 23:02:59,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 23:02:59,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 23:02:59,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-09-12 23:02:59,580 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 23:03:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:03:00,584 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2024-09-12 23:03:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 23:03:00,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) Word has length 41 [2024-09-12 23:03:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:03:00,586 INFO L225 Difference]: With dead ends: 111 [2024-09-12 23:03:00,586 INFO L226 Difference]: Without dead ends: 93 [2024-09-12 23:03:00,586 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-09-12 23:03:00,587 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-12 23:03:00,587 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 140 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-12 23:03:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-12 23:03:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-09-12 23:03:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 66 states have internal predecessors, (76), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:03:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2024-09-12 23:03:00,619 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 41 [2024-09-12 23:03:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:03:00,619 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2024-09-12 23:03:00,619 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 8 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 6 states have call predecessors, (11), 7 states have call successors, (11) [2024-09-12 23:03:00,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2024-09-12 23:03:00,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 23:03:00,622 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:03:00,622 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 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-12 23:03:00,627 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 (9)] Forceful destruction successful, exit code 0 [2024-09-12 23:03:00,822 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 23:03:00,823 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:03:00,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:00,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1916454658, now seen corresponding path program 2 times [2024-09-12 23:03:00,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 23:03:00,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650041575] [2024-09-12 23:03:00,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:03:00,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 23:03:00,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 23:03:00,824 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 23:03:00,825 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 (10)] Waiting until timeout for monitored process [2024-09-12 23:03:00,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:03:00,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:03:00,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-12 23:03:00,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:03:04,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 23:03:04,898 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 23:03:04,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 23:03:04,910 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-12 23:03:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:03:05,451 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:03:09,043 INFO L349 Elim1Store]: treesize reduction 42, result has 28.8 percent of original size [2024-09-12 23:03:09,043 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-12 23:03:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:03:09,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 23:03:09,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650041575] [2024-09-12 23:03:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650041575] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:03:09,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:03:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 30 [2024-09-12 23:03:09,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796347791] [2024-09-12 23:03:09,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:03:09,634 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-12 23:03:09,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 23:03:09,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-12 23:03:09,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2024-09-12 23:03:09,635 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 27 states have internal predecessors, (49), 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-12 23:03:14,102 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-12 23:03:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 23:03:28,152 INFO L93 Difference]: Finished difference Result 149 states and 186 transitions. [2024-09-12 23:03:28,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-09-12 23:03:28,153 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 27 states have internal predecessors, (49), 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 40 [2024-09-12 23:03:28,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 23:03:28,155 INFO L225 Difference]: With dead ends: 149 [2024-09-12 23:03:28,155 INFO L226 Difference]: Without dead ends: 147 [2024-09-12 23:03:28,156 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=423, Invalid=2883, Unknown=0, NotChecked=0, Total=3306 [2024-09-12 23:03:28,156 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 100 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 43 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-09-12 23:03:28,156 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 405 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 693 Invalid, 1 Unknown, 0 Unchecked, 9.6s Time] [2024-09-12 23:03:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-09-12 23:03:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 100. [2024-09-12 23:03:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.295774647887324) internal successors, (92), 74 states have internal predecessors, (92), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (17), 14 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-12 23:03:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2024-09-12 23:03:28,205 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 40 [2024-09-12 23:03:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 23:03:28,206 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2024-09-12 23:03:28,206 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 27 states have internal predecessors, (49), 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-12 23:03:28,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2024-09-12 23:03:28,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-12 23:03:28,207 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 23:03:28,208 INFO L216 NwaCegarLoop]: trace histogram [3, 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] [2024-09-12 23:03:28,213 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 (10)] Ended with exit code 0 [2024-09-12 23:03:28,408 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 23:03:28,409 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-12 23:03:28,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 23:03:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1697599940, now seen corresponding path program 2 times [2024-09-12 23:03:28,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 23:03:28,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751071728] [2024-09-12 23:03:28,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 23:03:28,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-12 23:03:28,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 23:03:28,411 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-12 23:03:28,412 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 (11)] Waiting until timeout for monitored process [2024-09-12 23:03:28,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 23:03:28,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 23:03:28,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-12 23:03:28,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 23:03:33,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 23:03:33,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 23:03:33,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-12 23:03:33,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 23:03:33,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-12 23:03:33,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 23:03:33,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 20 [2024-09-12 23:03:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 23:03:34,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 23:03:51,819 INFO L349 Elim1Store]: treesize reduction 110, result has 19.7 percent of original size [2024-09-12 23:03:51,819 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 79 treesize of output 41 [2024-09-12 23:03:52,426 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 23:03:52,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 23:03:52,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751071728] [2024-09-12 23:03:52,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751071728] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 23:03:52,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 23:03:52,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 31 [2024-09-12 23:03:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795196767] [2024-09-12 23:03:52,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 23:03:52,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-12 23:03:52,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 23:03:52,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-12 23:03:52,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=802, Unknown=3, NotChecked=0, Total=930 [2024-09-12 23:03:52,428 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand has 31 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 28 states have internal predecessors, (49), 6 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-12 23:04:58,961 WARN L293 SmtUtils]: Spent 1.07m on a formula simplification that was a NOOP. DAG size: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:06:04,283 WARN L293 SmtUtils]: Spent 1.07m on a formula simplification that was a NOOP. DAG size: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:06:10,040 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 [] [2024-09-12 23:06:14,044 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 [] [2024-09-12 23:06:18,046 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 [] [2024-09-12 23:07:40,225 WARN L293 SmtUtils]: Spent 1.08m on a formula simplification that was a NOOP. DAG size: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:07:45,209 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 [] [2024-09-12 23:07:49,214 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 [] [2024-09-12 23:07:53,220 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 [] [2024-09-12 23:08:02,711 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 [] [2024-09-12 23:08:06,719 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 [] [2024-09-12 23:08:10,721 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 [] [2024-09-12 23:08:16,855 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 [] [2024-09-12 23:08:20,867 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 [] [2024-09-12 23:08:24,869 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 [] [2024-09-12 23:08:28,877 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 [] [2024-09-12 23:09:33,511 WARN L293 SmtUtils]: Spent 1.07m on a formula simplification that was a NOOP. DAG size: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:09:37,947 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 [] [2024-09-12 23:09:41,952 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 [] [2024-09-12 23:10:14,289 WARN L293 SmtUtils]: Spent 16.10s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:10:18,732 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 [] [2024-09-12 23:10:22,737 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 [] [2024-09-12 23:10:26,742 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 [] [2024-09-12 23:10:30,748 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 [] [2024-09-12 23:10:34,753 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 [] [2024-09-12 23:10:38,758 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 [] [2024-09-12 23:11:15,152 WARN L293 SmtUtils]: Spent 16.14s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-12 23:11:19,806 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 [] [2024-09-12 23:11:23,811 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 [] [2024-09-12 23:11:27,815 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 [] [2024-09-12 23:11:32,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-09-12 23:11:36,727 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 [] [2024-09-12 23:11:40,734 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 [] [2024-09-12 23:11:44,740 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 [] [2024-09-12 23:11:48,743 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 [] [2024-09-12 23:11:52,748 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 [] [2024-09-12 23:11:56,754 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 [] [2024-09-12 23:12:00,758 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 [] [2024-09-12 23:12:04,913 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 [] [2024-09-12 23:12:08,916 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 [] [2024-09-12 23:12:12,921 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 [] Killed by 15