./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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:29:13,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:29:13,220 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 11:29:13,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:29:13,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:29:13,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:29:13,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:29:13,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:29:13,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:29:13,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:29:13,253 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:29:13,253 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:29:13,254 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:29:13,254 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:29:13,256 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:29:13,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:29:13,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:29:13,256 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:29:13,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 11:29:13,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:29:13,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:29:13,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:29:13,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:29:13,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:29:13,259 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:29:13,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:29:13,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:29:13,260 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:29:13,260 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:29:13,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:29:13,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:29:13,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:29:13,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:13,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:29:13,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:29:13,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:29:13,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 11:29:13,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 11:29:13,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:29:13,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:29:13,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:29:13,264 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:29:13,264 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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 11:29:13,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:29:13,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:29:13,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:29:13,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:29:13,536 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:29:13,537 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 11:29:14,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:29:14,956 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:29:14,957 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-25 11:29:14,965 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a8d456cbf/90e03676fd3e4aa4a3b7fa2f5d11e530/FLAGc652d96ae [2024-09-25 11:29:15,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a8d456cbf/90e03676fd3e4aa4a3b7fa2f5d11e530 [2024-09-25 11:29:15,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:29:15,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:29:15,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:15,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:29:15,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:29:15,360 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@689c7a93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15, skipping insertion in model container [2024-09-25 11:29:15,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:29:15,496 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 11:29:15,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:15,527 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:29:15,538 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 11:29:15,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:15,561 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:29:15,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15 WrapperNode [2024-09-25 11:29:15,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:15,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:15,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:29:15,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:29:15,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,584 INFO L138 Inliner]: procedures = 19, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:29:15,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:15,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:29:15,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:29:15,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:29:15,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,610 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 11:29:15,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:29:15,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:29:15,626 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:29:15,626 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:29:15,627 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (1/1) ... [2024-09-25 11:29:15,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:15,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:15,654 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 11:29:15,656 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 11:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:29:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:29:15,693 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 11:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 11:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-25 11:29:15,695 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-25 11:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:29:15,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 11:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:29:15,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 11:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 11:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 11:29:15,696 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 11:29:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:29:15,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:29:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:29:15,768 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:29:15,769 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:29:15,922 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-09-25 11:29:15,924 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:29:15,945 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:29:15,946 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:29:15,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:15 BoogieIcfgContainer [2024-09-25 11:29:15,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:29:15,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:29:15,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:29:15,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:29:15,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:29:15" (1/3) ... [2024-09-25 11:29:15,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a190b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:15, skipping insertion in model container [2024-09-25 11:29:15,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:15" (2/3) ... [2024-09-25 11:29:15,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a190b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:15, skipping insertion in model container [2024-09-25 11:29:15,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:15" (3/3) ... [2024-09-25 11:29:15,951 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-09-25 11:29:15,962 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:29:15,962 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:29:15,999 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:29:16,003 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;@472fd6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:29:16,004 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:29:16,006 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 11:29:16,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:29:16,011 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:16,012 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 11:29:16,012 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:16,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:16,015 INFO L85 PathProgramCache]: Analyzing trace with hash -2039448540, now seen corresponding path program 1 times [2024-09-25 11:29:16,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888076595] [2024-09-25 11:29:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,147 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,186 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 11:29:16,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888076595] [2024-09-25 11:29:16,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888076595] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:16,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:16,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 11:29:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335318238] [2024-09-25 11:29:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:16,192 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 11:29:16,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 11:29:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 11:29:16,213 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 11:29:16,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:16,321 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-09-25 11:29:16,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 11:29:16,323 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 11:29:16,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:16,328 INFO L225 Difference]: With dead ends: 72 [2024-09-25 11:29:16,328 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 11:29:16,332 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 11:29:16,336 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 11:29:16,337 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 11:29:16,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 11:29:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-25 11:29:16,383 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 11:29:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-25 11:29:16,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2024-09-25 11:29:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:16,388 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-25 11:29:16,388 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 11:29:16,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-25 11:29:16,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:29:16,392 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:16,392 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 11:29:16,392 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 11:29:16,393 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:16,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:16,393 INFO L85 PathProgramCache]: Analyzing trace with hash 975655078, now seen corresponding path program 1 times [2024-09-25 11:29:16,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:16,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990252115] [2024-09-25 11:29:16,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:16,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,657 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:16,660 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 11:29:16,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990252115] [2024-09-25 11:29:16,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990252115] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:16,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:16,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 11:29:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373929825] [2024-09-25 11:29:16,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:16,664 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 11:29:16,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:16,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 11:29:16,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 11:29:16,667 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 11:29:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:16,909 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2024-09-25 11:29:16,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 11:29:16,910 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 11:29:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:16,914 INFO L225 Difference]: With dead ends: 62 [2024-09-25 11:29:16,914 INFO L226 Difference]: Without dead ends: 60 [2024-09-25 11:29:16,914 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 11:29:16,915 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 11:29:16,916 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 11:29:16,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-25 11:29:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2024-09-25 11:29:16,936 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 11:29:16,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2024-09-25 11:29:16,937 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 22 [2024-09-25 11:29:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:16,938 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2024-09-25 11:29:16,938 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 11:29:16,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2024-09-25 11:29:16,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 11:29:16,940 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:16,940 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 11:29:16,941 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 11:29:16,941 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:16,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -599674086, now seen corresponding path program 1 times [2024-09-25 11:29:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:16,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715931156] [2024-09-25 11:29:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,194 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 11:29:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,208 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 11:29:17,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:17,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715931156] [2024-09-25 11:29:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715931156] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877254850] [2024-09-25 11:29:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:17,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:17,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:17,214 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 11:29:17,215 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 11:29:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 11:29:17,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:17,374 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 11:29:17,374 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877254850] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 11:29:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2024-09-25 11:29:17,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557364969] [2024-09-25 11:29:17,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:17,376 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 11:29:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 11:29:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-09-25 11:29:17,377 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 11:29:17,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:17,518 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-09-25 11:29:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 11:29:17,519 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 11:29:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:17,520 INFO L225 Difference]: With dead ends: 70 [2024-09-25 11:29:17,525 INFO L226 Difference]: Without dead ends: 68 [2024-09-25 11:29:17,525 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 11:29:17,526 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 11:29:17,526 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 11:29:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-25 11:29:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2024-09-25 11:29:17,538 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 11:29:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-25 11:29:17,539 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2024-09-25 11:29:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:17,539 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-25 11:29:17,540 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 11:29:17,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-25 11:29:17,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 11:29:17,541 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:17,541 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 11:29:17,555 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 11:29:17,746 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 11:29:17,747 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:17,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:17,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1182090583, now seen corresponding path program 1 times [2024-09-25 11:29:17,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 11:29:17,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584741746] [2024-09-25 11:29:17,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:17,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 11:29:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 11:29:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 11:29:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,945 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-25 11:29:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 11:29:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-25 11:29:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 11:29:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:17,976 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 11:29:17,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 11:29:17,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584741746] [2024-09-25 11:29:17,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584741746] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:17,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734073640] [2024-09-25 11:29:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:17,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 11:29:17,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:17,980 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 11:29:17,982 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 11:29:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:18,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 11:29:18,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:18,066 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 11:29:18,278 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 11:29:18,351 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 11:29:18,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734073640] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:22,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:29:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2024-09-25 11:29:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196900165] [2024-09-25 11:29:22,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:29:22,431 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 11:29:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 11:29:22,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 11:29:22,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-25 11:29:22,432 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 11:29:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:22,763 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2024-09-25 11:29:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-25 11:29:22,764 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 11:29:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:22,765 INFO L225 Difference]: With dead ends: 45 [2024-09-25 11:29:22,765 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:29:22,765 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2024-09-25 11:29:22,766 INFO L434 NwaCegarLoop]: 8 mSDtfsCounter, 56 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:22,766 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.2s Time] [2024-09-25 11:29:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:29:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:29:22,767 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 11:29:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:29:22,767 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2024-09-25 11:29:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:22,767 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:29:22,768 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 11:29:22,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:22,769 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:29:22,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:29:22,771 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:29:22,784 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 11:29:22,975 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 11:29:22,978 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-09-25 11:29:22,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:29:23,844 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-25 11:29:23,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:29:23,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-09-25 11:29:23,853 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:23,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:23,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:23,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:23,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:29:23,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-09-25 11:29:23,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:29:23,854 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #valid [2024-09-25 11:29:23,855 WARN L156 FloydHoareUtils]: Requires clause for main contained old-variable. Original clause: (= |#memory_int#1| |old(#memory_int#1)|) Eliminated clause: true [2024-09-25 11:29:23,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:23,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #StackHeapBarrier [2024-09-25 11:29:23,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:23,855 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-09-25 11:29:23,857 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:183) 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 11:29:23,859 INFO L158 Benchmark]: Toolchain (without parser) took 8507.96ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 68.5MB in the beginning and 62.5MB in the end (delta: 6.1MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-09-25 11:29:23,859 INFO L158 Benchmark]: CDTParser took 10.80ms. Allocated memory is still 67.1MB. Free memory was 35.4MB in the beginning and 50.9MB in the end (delta: -15.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-09-25 11:29:23,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.17ms. Allocated memory is still 92.3MB. Free memory was 68.3MB in the beginning and 56.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-25 11:29:23,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.52ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 55.6MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-25 11:29:23,859 INFO L158 Benchmark]: Boogie Preprocessor took 40.29ms. Allocated memory is still 92.3MB. Free memory was 55.6MB in the beginning and 53.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-25 11:29:23,860 INFO L158 Benchmark]: RCFGBuilder took 320.44ms. Allocated memory is still 92.3MB. Free memory was 53.6MB in the beginning and 63.9MB in the end (delta: -10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-25 11:29:23,860 INFO L158 Benchmark]: TraceAbstraction took 7911.07ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 62.5MB in the end (delta: 588.3kB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-09-25 11:29:23,861 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 10.80ms. Allocated memory is still 67.1MB. Free memory was 35.4MB in the beginning and 50.9MB in the end (delta: -15.5MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.17ms. Allocated memory is still 92.3MB. Free memory was 68.3MB in the beginning and 56.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.52ms. Allocated memory is still 92.3MB. Free memory was 56.6MB in the beginning and 55.6MB in the end (delta: 988.6kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 40.29ms. Allocated memory is still 92.3MB. Free memory was 55.6MB in the beginning and 53.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 320.44ms. Allocated memory is still 92.3MB. Free memory was 53.6MB in the beginning and 63.9MB in the end (delta: -10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7911.07ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 63.1MB in the beginning and 62.5MB in the end (delta: 588.3kB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #valid - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #StackHeapBarrier - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 * 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: 7.0s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 305 SdHoareTripleChecker+Invalid, 0.5s 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.6s 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.3s 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 11:29:23,887 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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 --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 11:29:25,509 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 11:29:25,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-25 11:29:25,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 11:29:25,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 11:29:25,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 11:29:25,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 11:29:25,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 11:29:25,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 11:29:25,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 11:29:25,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 11:29:25,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 11:29:25,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 11:29:25,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 11:29:25,597 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 11:29:25,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 11:29:25,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 11:29:25,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 11:29:25,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 11:29:25,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 11:29:25,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 11:29:25,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 11:29:25,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 11:29:25,601 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-25 11:29:25,601 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-25 11:29:25,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 11:29:25,602 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-25 11:29:25,602 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 11:29:25,602 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 11:29:25,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 11:29:25,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 11:29:25,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 11:29:25,602 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 11:29:25,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 11:29:25,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:25,603 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 11:29:25,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 11:29:25,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 11:29:25,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-25 11:29:25,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-25 11:29:25,603 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 11:29:25,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 11:29:25,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 11:29:25,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 11:29:25,605 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-25 11:29:25,605 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.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true 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 11:29:25,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 11:29:25,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 11:29:25,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 11:29:25,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 11:29:25,831 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 11:29:25,833 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 11:29:27,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 11:29:27,164 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 11:29:27,165 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/elimination_max_rec.c [2024-09-25 11:29:27,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/e7ab41b54/f9e4a0ad17ea47f18242cc798145c83c/FLAG20148662d [2024-09-25 11:29:27,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/e7ab41b54/f9e4a0ad17ea47f18242cc798145c83c [2024-09-25 11:29:27,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 11:29:27,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 11:29:27,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:27,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 11:29:27,194 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 11:29:27,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bbb263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27, skipping insertion in model container [2024-09-25 11:29:27,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 11:29:27,344 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 11:29:27,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:27,378 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 11:29:27,388 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 11:29:27,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 11:29:27,412 INFO L204 MainTranslator]: Completed translation [2024-09-25 11:29:27,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27 WrapperNode [2024-09-25 11:29:27,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 11:29:27,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:27,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 11:29:27,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 11:29:27,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,431 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 11:29:27,431 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 11:29:27,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 11:29:27,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 11:29:27,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 11:29:27,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,457 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 11:29:27,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 11:29:27,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 11:29:27,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 11:29:27,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 11:29:27,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (1/1) ... [2024-09-25 11:29:27,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 11:29:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 11:29:27,502 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 11:29:27,504 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 11:29:27,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 11:29:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-25 11:29:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-25 11:29:27,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 11:29:27,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 11:29:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 11:29:27,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 11:29:27,541 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-25 11:29:27,542 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-25 11:29:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 11:29:27,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 11:29:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 11:29:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-09-25 11:29:27,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-09-25 11:29:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 11:29:27,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 11:29:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 11:29:27,543 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 11:29:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 11:29:27,544 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 11:29:27,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 11:29:27,619 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 11:29:27,621 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 11:29:27,761 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-09-25 11:29:27,761 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 11:29:27,777 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 11:29:27,777 INFO L317 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-25 11:29:27,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:27 BoogieIcfgContainer [2024-09-25 11:29:27,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 11:29:27,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 11:29:27,779 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 11:29:27,782 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 11:29:27,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 11:29:27" (1/3) ... [2024-09-25 11:29:27,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcbc7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:27, skipping insertion in model container [2024-09-25 11:29:27,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 11:29:27" (2/3) ... [2024-09-25 11:29:27,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fcbc7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 11:29:27, skipping insertion in model container [2024-09-25 11:29:27,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 11:29:27" (3/3) ... [2024-09-25 11:29:27,784 INFO L112 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2024-09-25 11:29:27,799 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 11:29:27,799 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 11:29:27,852 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 11:29:27,857 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;@6a3f2dcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 11:29:27,857 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 11:29:27,861 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 11:29:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:29:27,867 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:27,867 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 11:29:27,868 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:27,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2039448540, now seen corresponding path program 1 times [2024-09-25 11:29:27,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:27,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375600158] [2024-09-25 11:29:27,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:27,884 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 11:29:27,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:27,887 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 11:29:27,888 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 11:29:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:27,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-09-25 11:29:27,968 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:27,980 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 11:29:27,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:27,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:27,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375600158] [2024-09-25 11:29:27,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375600158] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:27,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:27,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 11:29:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342309245] [2024-09-25 11:29:27,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:27,986 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 11:29:27,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:28,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 11:29:28,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 11:29:28,004 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 11:29:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:28,037 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-09-25 11:29:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 11:29:28,039 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 11:29:28,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:28,045 INFO L225 Difference]: With dead ends: 72 [2024-09-25 11:29:28,045 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 11:29:28,049 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 11:29:28,053 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 11:29:28,054 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 11:29:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 11:29:28,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-25 11:29:28,081 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 11:29:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-25 11:29:28,083 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2024-09-25 11:29:28,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:28,083 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-25 11:29:28,083 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 11:29:28,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-25 11:29:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 11:29:28,085 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:28,085 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 11:29:28,089 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-25 11:29:28,286 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 11:29:28,286 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:28,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:28,287 INFO L85 PathProgramCache]: Analyzing trace with hash 975655078, now seen corresponding path program 1 times [2024-09-25 11:29:28,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:28,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358778835] [2024-09-25 11:29:28,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:28,288 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 11:29:28,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:28,291 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 11:29:28,291 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 11:29:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:28,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 11:29:28,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:28,633 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 11:29:28,634 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 11:29:28,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:28,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358778835] [2024-09-25 11:29:28,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358778835] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 11:29:28,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 11:29:28,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-25 11:29:28,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165331240] [2024-09-25 11:29:28,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 11:29:28,636 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-25 11:29:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:28,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-25 11:29:28,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-25 11:29:28,637 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 11:29:28,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:28,865 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2024-09-25 11:29:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-25 11:29:28,866 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 11:29:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:28,867 INFO L225 Difference]: With dead ends: 54 [2024-09-25 11:29:28,867 INFO L226 Difference]: Without dead ends: 49 [2024-09-25 11:29:28,868 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 11:29:28,868 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.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:28,869 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.1s Time] [2024-09-25 11:29:28,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-25 11:29:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-25 11:29:28,881 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 11:29:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2024-09-25 11:29:28,884 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 22 [2024-09-25 11:29:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:28,893 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2024-09-25 11:29:28,893 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 11:29:28,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:28,894 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2024-09-25 11:29:28,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 11:29:28,894 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:28,894 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 11:29:28,898 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 11:29:29,097 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 11:29:29,098 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:29,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -599674086, now seen corresponding path program 1 times [2024-09-25 11:29:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:29,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106914439] [2024-09-25 11:29:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:29,099 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 11:29:29,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:29,101 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 11:29:29,102 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 11:29:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:29,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-25 11:29:29,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:29,513 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 11:29:29,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:29,742 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 11:29:29,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:29,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106914439] [2024-09-25 11:29:29,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106914439] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:29:29,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:29:29,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2024-09-25 11:29:29,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570408780] [2024-09-25 11:29:29,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:29:29,743 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-25 11:29:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:29:29,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-25 11:29:29,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-09-25 11:29:29,744 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 11:29:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:29:30,745 INFO L93 Difference]: Finished difference Result 108 states and 140 transitions. [2024-09-25 11:29:30,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 11:29:30,746 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 11:29:30,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:29:30,748 INFO L225 Difference]: With dead ends: 108 [2024-09-25 11:29:30,748 INFO L226 Difference]: Without dead ends: 106 [2024-09-25 11:29:30,749 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=766, Unknown=0, NotChecked=0, Total=930 [2024-09-25 11:29:30,750 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-09-25 11:29:30,751 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.6s Time] [2024-09-25 11:29:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-25 11:29:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 82. [2024-09-25 11:29:30,783 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 11:29:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2024-09-25 11:29:30,785 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 32 [2024-09-25 11:29:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:29:30,787 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2024-09-25 11:29:30,787 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 11:29:30,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2024-09-25 11:29:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-25 11:29:30,789 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:29:30,789 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 11:29:30,792 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 11:29:30,991 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 11:29:30,992 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:29:30,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:29:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1182090583, now seen corresponding path program 1 times [2024-09-25 11:29:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:29:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385565477] [2024-09-25 11:29:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:30,993 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 11:29:30,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:29:30,994 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 11:29:30,995 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 11:29:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:31,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 11:29:31,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:36,376 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-25 11:29:36,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-09-25 11:29:36,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-25 11:29:36,539 INFO L349 Elim1Store]: treesize reduction 96, result has 47.3 percent of original size [2024-09-25 11:29:36,540 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 11:29:36,687 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 11:29:36,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:29:36,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:29:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385565477] [2024-09-25 11:29:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [385565477] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:29:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [703359932] [2024-09-25 11:29:36,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:29:36,942 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-25 11:29:36,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-25 11:29:36,955 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 11:29:36,956 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 11:29:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:29:37,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 11:29:37,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:29:37,049 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 11:30:14,076 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 11:30:19,823 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 11:30:24,926 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 11:30:25,615 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 11:30:25,727 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 11:30:25,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:30:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [703359932] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 11:30:50,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:30:50,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 13] total 33 [2024-09-25 11:30:50,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446530991] [2024-09-25 11:30:50,016 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:30:50,017 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-25 11:30:50,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:30:50,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-25 11:30:50,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1078, Unknown=13, NotChecked=204, Total=1406 [2024-09-25 11:30:50,018 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 11:30:54,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-25 11:30:58,192 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 11:31:02,279 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 11:32:57,934 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 11:33:01,969 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 11:33:06,909 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 11:33:10,923 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 11:33:11,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:33:11,605 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2024-09-25 11:33:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-09-25 11:33:11,606 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 11:33:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:33:11,606 INFO L225 Difference]: With dead ends: 145 [2024-09-25 11:33:11,607 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 11:33:11,608 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 188.4s TimeCoverageRelationStatistics Valid=329, Invalid=2516, Unknown=29, NotChecked=318, Total=3192 [2024-09-25 11:33:11,608 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 62 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 40 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 31.1s IncrementalHoareTripleChecker+Time [2024-09-25 11:33:11,609 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 415 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 552 Invalid, 7 Unknown, 179 Unchecked, 31.1s Time] [2024-09-25 11:33:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 11:33:11,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2024-09-25 11:33:11,617 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 11:33:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-09-25 11:33:11,617 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 41 [2024-09-25 11:33:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:33:11,617 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-09-25 11:33:11,618 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 11:33:11,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:33:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-09-25 11:33:11,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-25 11:33:11,619 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 11:33:11,619 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 11:33:11,622 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 (5)] Ended with exit code 0 [2024-09-25 11:33:11,822 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 11:33:12,019 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 11:33:12,020 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 11:33:12,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:33:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash -837710144, now seen corresponding path program 1 times [2024-09-25 11:33:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-25 11:33:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262327927] [2024-09-25 11:33:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 11:33:12,021 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 11:33:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-25 11:33:12,023 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 11:33:12,023 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 11:33:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 11:33:12,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-09-25 11:33:12,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 11:33:13,208 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 11:33:13,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 11:33:15,329 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 11:33:15,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-25 11:33:15,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262327927] [2024-09-25 11:33:15,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262327927] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 11:33:15,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 11:33:15,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2024-09-25 11:33:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475891962] [2024-09-25 11:33:15,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 11:33:15,330 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-25 11:33:15,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-25 11:33:15,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-25 11:33:15,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-09-25 11:33:15,331 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) [2024-09-25 11:33:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 11:33:21,194 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-09-25 11:33:21,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-09-25 11:33:21,195 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 52 [2024-09-25 11:33:21,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 11:33:21,196 INFO L225 Difference]: With dead ends: 85 [2024-09-25 11:33:21,196 INFO L226 Difference]: Without dead ends: 0 [2024-09-25 11:33:21,198 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=610, Invalid=2582, Unknown=0, NotChecked=0, Total=3192 [2024-09-25 11:33:21,198 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 83 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-25 11:33:21,198 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 236 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-25 11:33:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-25 11:33:21,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-25 11:33:21,199 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 11:33:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-25 11:33:21,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-09-25 11:33:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 11:33:21,200 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-25 11:33:21,200 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-09-25 11:33:21,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 11:33:21,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-25 11:33:21,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-25 11:33:21,202 INFO L785 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-25 11:33:21,207 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-25 11:33:21,403 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-25 11:33:21,405 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-09-25 11:33:21,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-25 11:33:32,123 WARN L293 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 150 DAG size of output: 78 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-09-25 11:33:43,025 WARN L293 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 54 DAG size of output: 3 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)