./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/elimination_max_rec.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_rec.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:09:55,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:09:55,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:09:55,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:09:55,432 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:09:55,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:09:55,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:09:55,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:09:55,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:09:55,472 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:09:55,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:09:55,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:09:55,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:09:55,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:09:55,477 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:09:55,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:09:55,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:09:55,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:09:55,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:09:55,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:09:55,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:09:55,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:09:55,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:09:55,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:09:55,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:09:55,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:09:55,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:09:55,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:09:55,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:09:55,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:09:55,481 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:09:55,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:09:55,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:55,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:09:55,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:09:55,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:09:55,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:09:55,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:09:55,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:09:55,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:09:55,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:09:55,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:09:55,486 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:09:55,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:09:55,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:09:55,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:09:55,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:09:55,803 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:09:55,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-25 00:09:57,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:09:57,550 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:09:57,551 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-25 00:09:57,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/1affd81cf/4fb6f7053d634785834451ff43989739/FLAG4203e2b5a [2024-09-25 00:09:57,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/1affd81cf/4fb6f7053d634785834451ff43989739 [2024-09-25 00:09:57,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:09:57,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:09:57,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:57,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:09:57,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:09:57,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:57" (1/1) ... [2024-09-25 00:09:57,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcb6a13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:57, skipping insertion in model container [2024-09-25 00:09:57,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:57" (1/1) ... [2024-09-25 00:09:57,967 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:09:58,135 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-25 00:09:58,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:58,186 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:09:58,200 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-25 00:09:58,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:58,233 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:09:58,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58 WrapperNode [2024-09-25 00:09:58,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:58,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:58,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:09:58,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:09:58,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,266 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:09:58,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:58,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:09:58,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:09:58,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:09:58,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,304 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-25 00:09:58,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:09:58,326 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:09:58,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:09:58,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:09:58,329 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (1/1) ... [2024-09-25 00:09:58,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:58,362 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-25 00:09:58,367 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-25 00:09:58,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:09:58,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 00:09:58,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 00:09:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:09:58,415 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:09:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:09:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 00:09:58,415 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-25 00:09:58,416 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-25 00:09:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:09:58,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:09:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 00:09:58,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:09:58,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:09:58,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 00:09:58,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 00:09:58,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 00:09:58,418 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 00:09:58,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:09:58,418 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:09:58,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:09:58,499 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:09:58,501 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:09:58,685 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-09-25 00:09:58,685 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:09:58,707 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:09:58,708 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:09:58,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:58 BoogieIcfgContainer [2024-09-25 00:09:58,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:09:58,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:09:58,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:09:58,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:09:58,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:09:57" (1/3) ... [2024-09-25 00:09:58,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44659aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:58, skipping insertion in model container [2024-09-25 00:09:58,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:58" (2/3) ... [2024-09-25 00:09:58,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44659aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:58, skipping insertion in model container [2024-09-25 00:09:58,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:58" (3/3) ... [2024-09-25 00:09:58,722 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-09-25 00:09:58,738 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:09:58,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:09:58,807 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:09:58,817 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;@765d8ca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:09:58,818 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:09:58,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 00:09:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 00:09:58,842 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:58,843 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:58,843 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:58,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2039448540, now seen corresponding path program 1 times [2024-09-25 00:09:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:58,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058492433] [2024-09-25 00:09:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,046 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,097 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:09:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:09:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:59,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058492433] [2024-09-25 00:09:59,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058492433] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:59,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:09:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:09:59,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834204988] [2024-09-25 00:09:59,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:59,126 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:09:59,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:59,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:09:59,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:09:59,158 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:09:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:59,316 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-09-25 00:09:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:09:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 00:09:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:59,326 INFO L225 Difference]: With dead ends: 72 [2024-09-25 00:09:59,327 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 00:09:59,331 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-25 00:09:59,335 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:59,336 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 00:09:59,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-25 00:09:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:09:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-25 00:09:59,421 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2024-09-25 00:09:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:59,427 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-25 00:09:59,427 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:09:59,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:59,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-25 00:09:59,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 00:09:59,436 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:59,437 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:59,437 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:09:59,437 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:59,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 975655078, now seen corresponding path program 1 times [2024-09-25 00:09:59,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:59,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828506973] [2024-09-25 00:09:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:59,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,778 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:09:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:09:59,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:59,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828506973] [2024-09-25 00:09:59,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828506973] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:59,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:09:59,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 00:09:59,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899921347] [2024-09-25 00:09:59,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:59,793 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:09:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:59,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:09:59,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:09:59,796 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:00,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:00,138 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-09-25 00:10:00,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:10:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2024-09-25 00:10:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:00,142 INFO L225 Difference]: With dead ends: 62 [2024-09-25 00:10:00,142 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 00:10:00,144 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:10:00,145 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:00,147 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 46 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:10:00,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 00:10:00,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2024-09-25 00:10:00,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 00:10:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-09-25 00:10:00,170 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 22 [2024-09-25 00:10:00,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:00,170 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-09-25 00:10:00,170 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-25 00:10:00,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-09-25 00:10:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 00:10:00,172 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:00,172 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] [2024-09-25 00:10:00,172 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:10:00,173 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:00,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash -599674086, now seen corresponding path program 1 times [2024-09-25 00:10:00,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:00,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228016181] [2024-09-25 00:10:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:00,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:00,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:00,451 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:00,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:10:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:00,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 00:10:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228016181] [2024-09-25 00:10:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228016181] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105291813] [2024-09-25 00:10:00,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:00,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:00,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:00,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:10:00,492 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:10:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:00,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 00:10:00,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:00,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:10:00,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105291813] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:00,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:10:00,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-25 00:10:00,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679543683] [2024-09-25 00:10:00,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:00,799 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 00:10:00,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:00,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 00:10:00,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:10:00,800 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:10:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:01,041 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-09-25 00:10:01,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:10:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-09-25 00:10:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:01,043 INFO L225 Difference]: With dead ends: 70 [2024-09-25 00:10:01,044 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 00:10:01,044 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:10:01,045 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:01,046 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 187 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:10:01,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 00:10:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2024-09-25 00:10:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:10:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-25 00:10:01,060 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2024-09-25 00:10:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:01,061 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-25 00:10:01,061 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 5 states have internal predecessors, (20), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 00:10:01,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-25 00:10:01,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 00:10:01,064 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:01,064 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, 1, 1, 1] [2024-09-25 00:10:01,082 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:10:01,265 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:01,266 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:01,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:01,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1182090583, now seen corresponding path program 1 times [2024-09-25 00:10:01,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:01,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14190246] [2024-09-25 00:10:01,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:01,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,595 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 00:10:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 00:10:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,623 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-25 00:10:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,630 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 00:10:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 00:10:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14190246] [2024-09-25 00:10:01,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14190246] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:01,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900829419] [2024-09-25 00:10:01,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:01,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:01,646 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:10:01,649 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:10:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:01,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 00:10:01,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:01,768 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-25 00:10:02,108 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-25 00:10:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:02,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:10:06,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900829419] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:06,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:10:06,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2024-09-25 00:10:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161241351] [2024-09-25 00:10:06,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:10:06,345 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 00:10:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:06,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 00:10:06,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-25 00:10:06,347 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 20 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 00:10:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:06,814 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-09-25 00:10:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 00:10:06,815 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 41 [2024-09-25 00:10:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:06,816 INFO L225 Difference]: With dead ends: 45 [2024-09-25 00:10:06,816 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 00:10:06,817 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-09-25 00:10:06,818 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:06,818 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 56 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:10:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 00:10:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 00:10:06,819 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-25 00:10:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 00:10:06,820 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-09-25 00:10:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:06,820 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 00:10:06,820 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 2.4375) internal successors, (39), 14 states have internal predecessors, (39), 7 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-25 00:10:06,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 00:10:06,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 00:10:06,824 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 00:10:06,841 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:10:07,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:07,032 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-25 00:10:07,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 00:10:08,173 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 00:10:08,186 WARN L155 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (= |#memory_int#1| |old(#memory_int#1)|) Eliminated clause: true [2024-09-25 00:10:08,192 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.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.ProcedureContractResult.translateTerm(ProcedureContractResult.java:69) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.(ProcedureContractResult.java:59) at de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.FloydHoareUtils.createProcedureContractResults(FloydHoareUtils.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) 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-25 00:10:08,197 INFO L158 Benchmark]: Toolchain (without parser) took 10256.61ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 98.1MB in the beginning and 168.6MB in the end (delta: -70.6MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-09-25 00:10:08,199 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 00:10:08,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.00ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 133.3MB in the end (delta: -35.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-09-25 00:10:08,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.27ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 132.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:10:08,200 INFO L158 Benchmark]: Boogie Preprocessor took 57.91ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 00:10:08,201 INFO L158 Benchmark]: RCFGBuilder took 382.88ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 114.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-25 00:10:08,201 INFO L158 Benchmark]: TraceAbstraction took 9484.62ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 114.4MB in the beginning and 168.6MB in the end (delta: -54.2MB). Peak memory consumption was 98.4MB. Max. memory is 16.1GB. [2024-09-25 00:10:08,203 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 131.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.00ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 133.3MB in the end (delta: -35.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.27ms. Allocated memory is still 167.8MB. Free memory was 133.3MB in the beginning and 132.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.91ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 130.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 382.88ms. Allocated memory is still 167.8MB. Free memory was 130.1MB in the beginning and 114.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9484.62ms. Allocated memory was 167.8MB in the beginning and 216.0MB in the end (delta: 48.2MB). Free memory was 114.4MB in the beginning and 168.6MB in the end (delta: -54.2MB). Peak memory consumption was 98.4MB. 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 7 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 70 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=2, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 36 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 190 NumberOfCodeBlocks, 190 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 184 ConstructedInterpolants, 13 QuantifiedInterpolants, 680 SizeOfPredicates, 17 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 17/26 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-25 00:10:08,252 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/11.0.12-open/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_rec.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 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:10:10,481 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:10:10,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-25 00:10:10,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:10:10,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:10:10,612 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:10:10,613 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:10:10,613 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:10:10,614 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:10:10,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:10:10,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:10:10,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:10:10,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:10:10,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:10:10,619 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:10:10,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:10:10,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:10:10,620 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:10:10,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:10:10,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:10:10,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:10:10,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:10:10,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:10:10,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-25 00:10:10,627 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-25 00:10:10,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:10:10,627 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-25 00:10:10,628 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:10:10,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:10:10,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:10:10,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:10:10,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:10:10,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:10:10,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:10:10,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:10:10,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:10:10,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:10:10,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:10:10,633 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-25 00:10:10,633 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-25 00:10:10,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:10:10,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:10:10,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:10:10,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:10:10,635 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-25 00:10:10,635 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 -> 1d89bfe4b4c4586e423a8e3ebdbb120ac074219803de53807cd9f075553c6e3a Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:10:10,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:10:10,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:10:10,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:10:10,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:10:10,981 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:10:10,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-25 00:10:12,595 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:10:12,824 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:10:12,826 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-25 00:10:12,837 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/fe2aa3a2f/99d8c649157e44b6b71404c62a862c74/FLAG4b293a692 [2024-09-25 00:10:12,866 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/fe2aa3a2f/99d8c649157e44b6b71404c62a862c74 [2024-09-25 00:10:12,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:10:12,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:10:12,874 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:10:12,874 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:10:12,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:10:12,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:10:12" (1/1) ... [2024-09-25 00:10:12,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3128cd30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:12, skipping insertion in model container [2024-09-25 00:10:12,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:10:12" (1/1) ... [2024-09-25 00:10:12,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:10:13,075 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-25 00:10:13,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:10:13,125 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:10:13,138 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c[493,506] [2024-09-25 00:10:13,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:10:13,175 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:10:13,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13 WrapperNode [2024-09-25 00:10:13,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:10:13,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:10:13,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:10:13,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:10:13,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,209 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:10:13,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:10:13,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:10:13,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:10:13,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:10:13,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,224 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,249 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-25 00:10:13,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,267 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,269 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:10:13,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:10:13,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:10:13,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:10:13,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (1/1) ... [2024-09-25 00:10:13,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:10:13,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:13,309 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-25 00:10:13,312 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-25 00:10:13,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:10:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-25 00:10:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-25 00:10:13,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 00:10:13,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 00:10:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:10:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:10:13,377 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-25 00:10:13,377 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-25 00:10:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:10:13,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:10:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 00:10:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-25 00:10:13,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-25 00:10:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:10:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:10:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 00:10:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 00:10:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:10:13,379 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:10:13,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:10:13,489 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:10:13,491 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:10:13,701 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-09-25 00:10:13,701 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:10:13,724 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:10:13,725 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 00:10:13,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:10:13 BoogieIcfgContainer [2024-09-25 00:10:13,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:10:13,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:10:13,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:10:13,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:10:13,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:10:12" (1/3) ... [2024-09-25 00:10:13,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165ce858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:10:13, skipping insertion in model container [2024-09-25 00:10:13,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:10:13" (2/3) ... [2024-09-25 00:10:13,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165ce858 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:10:13, skipping insertion in model container [2024-09-25 00:10:13,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:10:13" (3/3) ... [2024-09-25 00:10:13,737 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-09-25 00:10:13,759 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:10:13,760 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:10:13,825 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:10:13,842 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;@74c018bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:10:13,843 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:10:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 00:10:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 00:10:13,854 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:13,854 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:13,855 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:13,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:13,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2039448540, now seen corresponding path program 1 times [2024-09-25 00:10:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 00:10:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673869544] [2024-09-25 00:10:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:13,875 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-25 00:10:13,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 00:10:13,878 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-25 00:10:13,880 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-25 00:10:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:13,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-25 00:10:13,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:14,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:10:14,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 00:10:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673869544] [2024-09-25 00:10:14,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673869544] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:14,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 00:10:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418109496] [2024-09-25 00:10:14,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:14,023 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 00:10:14,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 00:10:14,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 00:10:14,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 00:10:14,049 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:10:14,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:14,088 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-09-25 00:10:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 00:10:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 00:10:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:14,098 INFO L225 Difference]: With dead ends: 72 [2024-09-25 00:10:14,099 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 00:10:14,104 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-25 00:10:14,109 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:14,111 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 00:10:14,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 00:10:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-25 00:10:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:10:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-25 00:10:14,157 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2024-09-25 00:10:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:14,159 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-25 00:10:14,159 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:10:14,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-25 00:10:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 00:10:14,164 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:14,164 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:14,168 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 (2)] Forceful destruction successful, exit code 0 [2024-09-25 00:10:14,365 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-25 00:10:14,366 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:14,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:14,367 INFO L85 PathProgramCache]: Analyzing trace with hash 975655078, now seen corresponding path program 1 times [2024-09-25 00:10:14,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 00:10:14,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282895887] [2024-09-25 00:10:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:14,368 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-25 00:10:14,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 00:10:14,372 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-25 00:10:14,373 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-25 00:10:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:14,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 00:10:14,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:14,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:10:14,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 00:10:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282895887] [2024-09-25 00:10:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282895887] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:10:14,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:10:14,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-25 00:10:14,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921787567] [2024-09-25 00:10:14,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:10:14,863 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 00:10:14,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 00:10:14,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 00:10:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-25 00:10:14,880 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:10:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:15,167 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-09-25 00:10:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 00:10:15,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-25 00:10:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:15,169 INFO L225 Difference]: With dead ends: 54 [2024-09-25 00:10:15,169 INFO L226 Difference]: Without dead ends: 49 [2024-09-25 00:10:15,169 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:10:15,171 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:15,171 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 179 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:10:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-25 00:10:15,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-25 00:10:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 00:10:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-09-25 00:10:15,186 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 22 [2024-09-25 00:10:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:15,186 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-09-25 00:10:15,187 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-25 00:10:15,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-09-25 00:10:15,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 00:10:15,188 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:15,188 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] [2024-09-25 00:10:15,192 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-09-25 00:10:15,391 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-25 00:10:15,392 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:15,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:15,393 INFO L85 PathProgramCache]: Analyzing trace with hash -599674086, now seen corresponding path program 1 times [2024-09-25 00:10:15,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 00:10:15,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13228600] [2024-09-25 00:10:15,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:15,394 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-25 00:10:15,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 00:10:15,398 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-25 00:10:15,399 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-25 00:10:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:15,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 00:10:15,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:16,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:10:16,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:16,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 00:10:16,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13228600] [2024-09-25 00:10:16,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13228600] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:10:16,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:10:16,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2024-09-25 00:10:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447566728] [2024-09-25 00:10:16,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:10:16,415 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 00:10:16,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 00:10:16,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 00:10:16,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-09-25 00:10:16,419 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 00:10:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:17,795 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-25 00:10:17,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 00:10:17,796 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2024-09-25 00:10:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:17,800 INFO L225 Difference]: With dead ends: 108 [2024-09-25 00:10:17,800 INFO L226 Difference]: Without dead ends: 106 [2024-09-25 00:10:17,801 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2024-09-25 00:10:17,802 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:17,803 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 523 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 00:10:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-25 00:10:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2024-09-25 00:10:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 52 states have internal predecessors, (56), 24 states have call successors, (24), 11 states have call predecessors, (24), 9 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-09-25 00:10:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2024-09-25 00:10:17,847 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 32 [2024-09-25 00:10:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:17,848 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-09-25 00:10:17,848 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 6 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 00:10:17,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-09-25 00:10:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 00:10:17,851 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:17,851 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, 1, 1, 1] [2024-09-25 00:10:17,856 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-25 00:10:18,051 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 [2024-09-25 00:10:18,052 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:18,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:18,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1182090583, now seen corresponding path program 1 times [2024-09-25 00:10:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 00:10:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1512407547] [2024-09-25 00:10:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:18,054 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-25 00:10:18,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 00:10:18,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-25 00:10:18,057 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-25 00:10:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:18,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 00:10:18,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:23,936 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-25 00:10:23,937 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-25 00:10:23,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 00:10:24,159 INFO L349 Elim1Store]: treesize reduction 96, result has 47.3 percent of original size [2024-09-25 00:10:24,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 56 treesize of output 101 [2024-09-25 00:10:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:10:24,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:10:24,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 00:10:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1512407547] [2024-09-25 00:10:24,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1512407547] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:24,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1971274681] [2024-09-25 00:10:24,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:24,768 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-25 00:10:24,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-25 00:10:24,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-25 00:10:24,773 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-09-25 00:10:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:24,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 00:10:24,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:24,895 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-25 00:10:59,406 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_3 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_3) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-25 00:11:07,716 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_4 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_4) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-25 00:11:14,336 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_check_~a.base_BEFORE_CALL_5 (_ BitVec 32))) (= (select |c_#memory_int#1| v_check_~a.base_BEFORE_CALL_5) ((as const (Array (_ BitVec 32) (_ BitVec 32))) (_ bv0 32)))) is different from true [2024-09-25 00:11:15,189 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-25 00:11:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-09-25 00:11:15,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:11:43,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1971274681] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:11:43,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:11:43,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-09-25 00:11:43,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785989058] [2024-09-25 00:11:43,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:11:43,855 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-25 00:11:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 00:11:43,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-25 00:11:43,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1078, Unknown=15, NotChecked=204, Total=1406 [2024-09-25 00:11:43,857 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 24 states have internal predecessors, (47), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 00:11:48,082 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-25 00:11:52,147 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-25 00:11:56,489 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-25 00:14:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:14:20,927 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2024-09-25 00:14:20,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-25 00:14:20,928 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 24 states have internal predecessors, (47), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) Word has length 41 [2024-09-25 00:14:20,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:14:20,930 INFO L225 Difference]: With dead ends: 145 [2024-09-25 00:14:20,930 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 00:14:20,932 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 227.1s TimeCoverageRelationStatistics Valid=358, Invalid=2704, Unknown=30, NotChecked=330, Total=3422 [2024-09-25 00:14:20,933 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 65 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 43 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:14:20,933 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 419 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 560 Invalid, 3 Unknown, 179 Unchecked, 14.2s Time] [2024-09-25 00:14:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 00:14:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-09-25 00:14:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 12 states have call successors, (12), 11 states have call predecessors, (12), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-25 00:14:20,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-09-25 00:14:20,951 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 41 [2024-09-25 00:14:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:14:20,952 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-09-25 00:14:20,952 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 24 states have internal predecessors, (47), 10 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2024-09-25 00:14:20,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:14:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-09-25 00:14:20,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-25 00:14:20,954 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:14:20,954 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:14:20,958 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 (5)] Forceful destruction successful, exit code 0 [2024-09-25 00:14:21,158 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-09-25 00:14:21,355 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-25 00:14:21,355 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:14:21,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:14:21,356 INFO L85 PathProgramCache]: Analyzing trace with hash -837710144, now seen corresponding path program 1 times [2024-09-25 00:14:21,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 00:14:21,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92626132] [2024-09-25 00:14:21,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:14:21,357 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-25 00:14:21,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 00:14:21,360 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-25 00:14:21,360 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-25 00:14:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:14:21,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-25 00:14:21,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:14:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 7 proven. 32 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:14:23,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:14:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:14:26,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 00:14:26,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92626132] [2024-09-25 00:14:26,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92626132] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:14:26,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:14:26,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-09-25 00:14:26,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707751378] [2024-09-25 00:14:26,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:14:26,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-25 00:14:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 00:14:26,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-25 00:14:26,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-09-25 00:14:26,571 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 31 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 23 states have internal predecessors, (54), 12 states have call successors, (21), 10 states have call predecessors, (21), 3 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11)