./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-with-pointer/simple-recursive.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 e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:56:05,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:56:05,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:56:05,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:56:05,583 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:56:05,605 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:56:05,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:56:05,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:56:05,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:56:05,608 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:56:05,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:56:05,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:56:05,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:56:05,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:56:05,611 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:56:05,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:56:05,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:56:05,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:56:05,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:56:05,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:56:05,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:56:05,613 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:56:05,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:56:05,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:56:05,614 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:56:05,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:56:05,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:56:05,615 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:56:05,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:56:05,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:56:05,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:56:05,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:56:05,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:56:05,616 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:56:05,616 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:56:05,616 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:56:05,616 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:56:05,616 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:56:05,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:56:05,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:56:05,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:56:05,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:56:05,617 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 -> e4b2b33802a1e3212162c0e55c40efaad08f7abe5e8690f0efef5fec80921b38 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:56:05,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:56:05,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:56:05,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:56:05,914 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:56:05,915 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:56:05,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-09-12 19:56:07,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:56:07,351 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:56:07,352 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-09-12 19:56:07,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/ac2566ceb/c10fda3241c6410b9988b7e6acc85ef0/FLAGd68ddcfb1 [2024-09-12 19:56:07,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/ac2566ceb/c10fda3241c6410b9988b7e6acc85ef0 [2024-09-12 19:56:07,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:56:07,377 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:56:07,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:56:07,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:56:07,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:56:07,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee073bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07, skipping insertion in model container [2024-09-12 19:56:07,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:56:07,535 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2024-09-12 19:56:07,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:56:07,554 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:56:07,568 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2024-09-12 19:56:07,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:56:07,590 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:56:07,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07 WrapperNode [2024-09-12 19:56:07,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:56:07,591 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:56:07,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:56:07,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:56:07,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,610 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:56:07,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:56:07,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:56:07,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:56:07,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:56:07,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,634 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2024-09-12 19:56:07,635 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,642 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:56:07,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:56:07,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:56:07,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:56:07,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (1/1) ... [2024-09-12 19:56:07,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:56:07,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:07,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-12 19:56:07,678 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-12 19:56:07,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:56:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-09-12 19:56:07,723 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-09-12 19:56:07,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:56:07,723 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:56:07,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:56:07,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 19:56:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 19:56:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2024-09-12 19:56:07,725 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2024-09-12 19:56:07,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 19:56:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 19:56:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:56:07,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:56:07,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:56:07,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:56:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 19:56:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 19:56:07,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 19:56:07,788 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:56:07,790 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:56:07,948 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-12 19:56:07,948 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:56:07,975 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:56:07,977 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:56:07,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:56:07 BoogieIcfgContainer [2024-09-12 19:56:07,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:56:07,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:56:07,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:56:07,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:56:07,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:56:07" (1/3) ... [2024-09-12 19:56:07,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0581f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:56:07, skipping insertion in model container [2024-09-12 19:56:07,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:56:07" (2/3) ... [2024-09-12 19:56:07,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c0581f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:56:07, skipping insertion in model container [2024-09-12 19:56:07,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:56:07" (3/3) ... [2024-09-12 19:56:07,987 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2024-09-12 19:56:08,004 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:56:08,004 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-09-12 19:56:08,065 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:56:08,074 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;@6b2a76e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:56:08,074 INFO L337 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-09-12 19:56:08,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-12 19:56:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 19:56:08,084 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:08,085 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:08,086 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION, plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-09-12 19:56:08,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2080347355, now seen corresponding path program 1 times [2024-09-12 19:56:08,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:08,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734693212] [2024-09-12 19:56:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:08,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:08,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:08,563 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:08,573 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-12 19:56:08,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:08,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734693212] [2024-09-12 19:56:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734693212] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:56:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045164599] [2024-09-12 19:56:08,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:08,583 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:56:08,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:08,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:56:08,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:56:08,604 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 17 states have internal predecessors, (18), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:08,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:08,725 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2024-09-12 19:56:08,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:56:08,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 19:56:08,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:08,732 INFO L225 Difference]: With dead ends: 49 [2024-09-12 19:56:08,732 INFO L226 Difference]: Without dead ends: 27 [2024-09-12 19:56:08,739 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:56:08,744 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:08,744 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 94 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-12 19:56:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-09-12 19:56:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 6 states have call successors, (6), 6 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2024-09-12 19:56:08,772 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 11 [2024-09-12 19:56:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:08,772 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2024-09-12 19:56:08,773 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:08,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2024-09-12 19:56:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 19:56:08,774 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:08,774 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:08,774 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:56:08,774 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION, plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-09-12 19:56:08,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -205653119, now seen corresponding path program 1 times [2024-09-12 19:56:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399446553] [2024-09-12 19:56:08,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:08,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:08,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:08,869 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-12 19:56:08,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:08,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399446553] [2024-09-12 19:56:08,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399446553] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:08,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:56:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447259836] [2024-09-12 19:56:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:08,871 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:56:08,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:08,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:56:08,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:56:08,876 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:08,913 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2024-09-12 19:56:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:56:08,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 19:56:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:08,917 INFO L225 Difference]: With dead ends: 27 [2024-09-12 19:56:08,918 INFO L226 Difference]: Without dead ends: 24 [2024-09-12 19:56:08,918 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:56:08,921 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:08,921 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:56:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-12 19:56:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-09-12 19:56:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 6 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:08,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2024-09-12 19:56:08,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 10 [2024-09-12 19:56:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:08,926 INFO L474 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2024-09-12 19:56:08,926 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:08,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2024-09-12 19:56:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-09-12 19:56:08,927 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:08,927 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:08,927 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:56:08,927 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION, plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-09-12 19:56:08,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1204569524, now seen corresponding path program 1 times [2024-09-12 19:56:08,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:08,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958311943] [2024-09-12 19:56:08,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:09,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:09,141 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-12 19:56:09,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:09,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958311943] [2024-09-12 19:56:09,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958311943] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:09,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:56:09,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 19:56:09,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202461363] [2024-09-12 19:56:09,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:09,144 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:56:09,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:09,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:56:09,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:56:09,147 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:09,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:09,240 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2024-09-12 19:56:09,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:56:09,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-09-12 19:56:09,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:09,242 INFO L225 Difference]: With dead ends: 25 [2024-09-12 19:56:09,243 INFO L226 Difference]: Without dead ends: 24 [2024-09-12 19:56:09,243 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:56:09,244 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:09,244 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-12 19:56:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-09-12 19:56:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 6 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2024-09-12 19:56:09,250 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2024-09-12 19:56:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:09,251 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2024-09-12 19:56:09,251 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:09,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2024-09-12 19:56:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 19:56:09,252 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:09,252 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:09,252 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:56:09,252 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION, plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-09-12 19:56:09,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:09,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1008686214, now seen corresponding path program 1 times [2024-09-12 19:56:09,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:09,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200086459] [2024-09-12 19:56:09,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:09,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:09,473 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:09,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:09,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200086459] [2024-09-12 19:56:09,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200086459] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:09,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929784019] [2024-09-12 19:56:09,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:09,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:09,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:09,479 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-12 19:56:09,482 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-12 19:56:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:09,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-12 19:56:09,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:09,588 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 15 treesize of output 1 [2024-09-12 19:56:09,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-09-12 19:56:09,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:09,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:09,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:09,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929784019] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:09,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:56:09,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2024-09-12 19:56:09,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326079782] [2024-09-12 19:56:09,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:09,893 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 19:56:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:09,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 19:56:09,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-09-12 19:56:09,894 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 7 states have call successors, (8), 7 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:10,137 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-09-12 19:56:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-12 19:56:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 7 states have call successors, (8), 7 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-12 19:56:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:10,139 INFO L225 Difference]: With dead ends: 39 [2024-09-12 19:56:10,139 INFO L226 Difference]: Without dead ends: 34 [2024-09-12 19:56:10,140 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2024-09-12 19:56:10,140 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 16 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:10,140 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-09-12 19:56:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-09-12 19:56:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 9 states have call predecessors, (9), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2024-09-12 19:56:10,152 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 17 [2024-09-12 19:56:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:10,152 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2024-09-12 19:56:10,152 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 15 states have internal predecessors, (25), 7 states have call successors, (8), 7 states have call predecessors, (8), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:10,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:10,153 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2024-09-12 19:56:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 19:56:10,156 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:10,156 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:10,173 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 19:56:10,356 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:10,357 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION, plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-09-12 19:56:10,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1411696529, now seen corresponding path program 1 times [2024-09-12 19:56:10,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:10,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030059426] [2024-09-12 19:56:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:10,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:10,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:10,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:10,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030059426] [2024-09-12 19:56:10,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030059426] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:10,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581336945] [2024-09-12 19:56:10,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:10,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:10,774 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-12 19:56:10,777 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-12 19:56:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:10,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-12 19:56:10,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:10,849 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 8 treesize of output 1 [2024-09-12 19:56:10,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-09-12 19:56:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 19:56:10,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:56:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581336945] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:56:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:56:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-09-12 19:56:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161707552] [2024-09-12 19:56:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:56:10,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:56:10,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:56:10,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2024-09-12 19:56:10,924 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:10,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:10,980 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2024-09-12 19:56:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:56:10,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2024-09-12 19:56:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:10,981 INFO L225 Difference]: With dead ends: 33 [2024-09-12 19:56:10,981 INFO L226 Difference]: Without dead ends: 32 [2024-09-12 19:56:10,981 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:56:10,982 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:10,983 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:56:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-12 19:56:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-12 19:56:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 9 states have call successors, (9), 9 states have call predecessors, (9), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2024-09-12 19:56:10,995 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2024-09-12 19:56:10,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:10,996 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2024-09-12 19:56:10,996 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:10,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:10,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2024-09-12 19:56:10,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 19:56:10,997 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:10,997 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:11,009 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:56:11,200 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:11,201 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION, plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-09-12 19:56:11,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash 836667802, now seen corresponding path program 2 times [2024-09-12 19:56:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307819619] [2024-09-12 19:56:11,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:11,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:11,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307819619] [2024-09-12 19:56:11,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307819619] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:11,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100293479] [2024-09-12 19:56:11,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:56:11,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:11,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:11,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:56:11,660 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-12 19:56:11,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:56:11,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:56:11,736 WARN L260 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-09-12 19:56:11,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:11,753 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 15 treesize of output 1 [2024-09-12 19:56:11,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-09-12 19:56:11,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-09-12 19:56:11,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-09-12 19:56:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:11,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:12,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100293479] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:12,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:56:12,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 43 [2024-09-12 19:56:12,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061024710] [2024-09-12 19:56:12,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:12,353 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-09-12 19:56:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:12,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-09-12 19:56:12,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2024-09-12 19:56:12,354 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 43 states, 35 states have (on average 1.457142857142857) internal successors, (51), 29 states have internal predecessors, (51), 15 states have call successors, (16), 15 states have call predecessors, (16), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:12,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:12,921 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-09-12 19:56:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-09-12 19:56:12,923 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 35 states have (on average 1.457142857142857) internal successors, (51), 29 states have internal predecessors, (51), 15 states have call successors, (16), 15 states have call predecessors, (16), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-09-12 19:56:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:12,924 INFO L225 Difference]: With dead ends: 65 [2024-09-12 19:56:12,924 INFO L226 Difference]: Without dead ends: 61 [2024-09-12 19:56:12,926 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=594, Invalid=3962, Unknown=0, NotChecked=0, Total=4556 [2024-09-12 19:56:12,926 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 70 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:12,926 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 112 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:56:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-12 19:56:12,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-09-12 19:56:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 17 states have call successors, (17), 17 states have call predecessors, (17), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:12,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2024-09-12 19:56:12,943 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 31 [2024-09-12 19:56:12,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:12,943 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2024-09-12 19:56:12,943 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 35 states have (on average 1.457142857142857) internal successors, (51), 29 states have internal predecessors, (51), 15 states have call successors, (16), 15 states have call predecessors, (16), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:12,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2024-09-12 19:56:12,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-12 19:56:12,945 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:56:12,945 INFO L216 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:56:12,958 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:56:13,145 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-12 19:56:13,146 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION, plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2024-09-12 19:56:13,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:13,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1790009894, now seen corresponding path program 3 times [2024-09-12 19:56:13,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:56:13,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599057846] [2024-09-12 19:56:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:56:13,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:56:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:14,536 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:56:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:56:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:56:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:56:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599057846] [2024-09-12 19:56:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599057846] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:56:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793846683] [2024-09-12 19:56:14,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:56:14,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:14,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:56:14,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-12 19:56:14,544 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-12 19:56:14,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 19:56:14,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:56:14,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-12 19:56:14,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:56:14,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 13 [2024-09-12 19:56:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-09-12 19:56:14,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:56:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-09-12 19:56:15,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793846683] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:56:15,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:56:15,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 10, 10] total 51 [2024-09-12 19:56:15,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994811399] [2024-09-12 19:56:15,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:56:15,020 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-09-12 19:56:15,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:56:15,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-09-12 19:56:15,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2290, Unknown=0, NotChecked=0, Total=2550 [2024-09-12 19:56:15,022 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 51 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 34 states have internal predecessors, (62), 18 states have call successors, (22), 18 states have call predecessors, (22), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:56:16,003 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2024-09-12 19:56:16,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-09-12 19:56:16,004 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 34 states have internal predecessors, (62), 18 states have call successors, (22), 18 states have call predecessors, (22), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-09-12 19:56:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:56:16,004 INFO L225 Difference]: With dead ends: 69 [2024-09-12 19:56:16,005 INFO L226 Difference]: Without dead ends: 0 [2024-09-12 19:56:16,009 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=930, Invalid=6210, Unknown=0, NotChecked=0, Total=7140 [2024-09-12 19:56:16,009 INFO L434 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:56:16,010 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 106 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:56:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-12 19:56:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-12 19:56:16,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-12 19:56:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-12 19:56:16,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59 [2024-09-12 19:56:16,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:56:16,011 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-12 19:56:16,011 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 34 states have internal predecessors, (62), 18 states have call successors, (22), 18 states have call predecessors, (22), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 19:56:16,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:56:16,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-12 19:56:16,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-12 19:56:16,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-09-12 19:56:16,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location plusErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 3 remaining) [2024-09-12 19:56:16,014 INFO L785 garLoopResultBuilder]: Registering result SAFE for location plusErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 3 remaining) [2024-09-12 19:56:16,028 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:56:16,215 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:56:16,218 INFO L408 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2024-09-12 19:56:16,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-12 19:56:17,361 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-12 19:56:17,385 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:56:17,388 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,388 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-12 19:56:17,388 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:56:17,389 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,389 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-12 19:56:17,389 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,389 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-12 19:56:17,390 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,399 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:56:17,401 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,401 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-12 19:56:17,401 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-12 19:56:17,401 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,402 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-12 19:56:17,402 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,403 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-12 19:56:17,403 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-09-12 19:56:17,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.09 07:56:17 BoogieIcfgContainer [2024-09-12 19:56:17,403 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-12 19:56:17,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-12 19:56:17,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-12 19:56:17,404 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-12 19:56:17,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:56:07" (3/4) ... [2024-09-12 19:56:17,406 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-12 19:56:17,409 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2024-09-12 19:56:17,409 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure foo [2024-09-12 19:56:17,410 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2024-09-12 19:56:17,410 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure plus [2024-09-12 19:56:17,412 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-09-12 19:56:17,412 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-09-12 19:56:17,413 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-12 19:56:17,413 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-12 19:56:17,488 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-12 19:56:17,490 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-12 19:56:17,490 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-12 19:56:17,491 INFO L158 Benchmark]: Toolchain (without parser) took 10113.60ms. Allocated memory was 71.3MB in the beginning and 203.4MB in the end (delta: 132.1MB). Free memory was 48.3MB in the beginning and 168.9MB in the end (delta: -120.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-09-12 19:56:17,491 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 84.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:56:17,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.73ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 37.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-12 19:56:17,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.69ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 36.2MB in the end (delta: 952.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:56:17,491 INFO L158 Benchmark]: Boogie Preprocessor took 36.51ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 34.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:56:17,492 INFO L158 Benchmark]: RCFGBuilder took 330.05ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 34.3MB in the beginning and 62.0MB in the end (delta: -27.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-09-12 19:56:17,492 INFO L158 Benchmark]: TraceAbstraction took 9423.65ms. Allocated memory was 92.3MB in the beginning and 203.4MB in the end (delta: 111.1MB). Free memory was 61.3MB in the beginning and 174.2MB in the end (delta: -112.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2024-09-12 19:56:17,493 INFO L158 Benchmark]: Witness Printer took 86.61ms. Allocated memory is still 203.4MB. Free memory was 173.1MB in the beginning and 168.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-12 19:56:17,494 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 47.1MB in the beginning and 47.0MB in the end (delta: 84.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.73ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 37.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.69ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 36.2MB in the end (delta: 952.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.51ms. Allocated memory is still 71.3MB. Free memory was 36.0MB in the beginning and 34.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 330.05ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 34.3MB in the beginning and 62.0MB in the end (delta: -27.8MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * TraceAbstraction took 9423.65ms. Allocated memory was 92.3MB in the beginning and 203.4MB in the end (delta: 111.1MB). Free memory was 61.3MB in the beginning and 174.2MB in the end (delta: -112.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. * Witness Printer took 86.61ms. Allocated memory is still 203.4MB. Free memory was 173.1MB in the beginning and 168.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] * 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: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 7]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 26 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 7, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 208 mSDsluCounter, 569 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 483 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 836 IncrementalHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 86 mSDtfsCounter, 836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2792 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=6, InterpolantAutomatonStates: 142, 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, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 305 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 398 ConstructedInterpolants, 0 QuantifiedInterpolants, 1656 SizeOfPredicates, 48 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 344/613 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-09-12 19:56:17,519 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE