./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 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e378df2c Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.contract-modifies-e378df2-m [2024-10-15 15:14:35,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-15 15:14:36,033 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-15 15:14:36,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-15 15:14:36,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-15 15:14:36,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-15 15:14:36,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-15 15:14:36,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-15 15:14:36,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-15 15:14:36,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-15 15:14:36,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-15 15:14:36,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-15 15:14:36,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-15 15:14:36,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-15 15:14:36,062 INFO L153 SettingsManager]: * Use SBE=true [2024-10-15 15:14:36,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-15 15:14:36,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-15 15:14:36,063 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-15 15:14:36,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-15 15:14:36,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-15 15:14:36,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-15 15:14:36,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-15 15:14:36,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-15 15:14:36,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-15 15:14:36,069 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-15 15:14:36,069 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-15 15:14:36,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-15 15:14:36,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-15 15:14:36,070 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-15 15:14:36,070 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-15 15:14:36,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-15 15:14:36,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-15 15:14:36,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:36,071 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-15 15:14:36,071 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-15 15:14:36,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-15 15:14:36,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-15 15:14:36,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-15 15:14:36,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-15 15:14:36,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-15 15:14:36,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-15 15:14:36,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-15 15:14:36,074 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.witnessprinter: Generate GraphML witnesses -> false [2024-10-15 15:14:36,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-15 15:14:36,391 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-15 15:14:36,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-15 15:14:36,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-15 15:14:36,396 INFO L274 PluginConnector]: CDTParser initialized [2024-10-15 15:14:36,398 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-10-15 15:14:37,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-15 15:14:38,023 INFO L384 CDTParser]: Found 1 translation units. [2024-10-15 15:14:38,023 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c [2024-10-15 15:14:38,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4ee18b748/bc845f1465cf48e3b11318c243c74031/FLAG2be0d967d [2024-10-15 15:14:38,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4ee18b748/bc845f1465cf48e3b11318c243c74031 [2024-10-15 15:14:38,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-15 15:14:38,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-15 15:14:38,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:38,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-15 15:14:38,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-15 15:14:38,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1621e1aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38, skipping insertion in model container [2024-10-15 15:14:38,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-15 15:14:38,262 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2024-10-15 15:14:38,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:38,280 INFO L200 MainTranslator]: Completed pre-run [2024-10-15 15:14:38,289 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive-with-pointer/simple-recursive.c[439,452] [2024-10-15 15:14:38,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-15 15:14:38,306 INFO L204 MainTranslator]: Completed translation [2024-10-15 15:14:38,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38 WrapperNode [2024-10-15 15:14:38,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-15 15:14:38,308 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:38,308 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-15 15:14:38,308 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-15 15:14:38,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,325 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-10-15 15:14:38,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-15 15:14:38,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-15 15:14:38,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-15 15:14:38,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-15 15:14:38,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,351 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-10-15 15:14:38,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-15 15:14:38,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-15 15:14:38,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-15 15:14:38,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-15 15:14:38,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (1/1) ... [2024-10-15 15:14:38,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-15 15:14:38,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:38,397 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-10-15 15:14:38,400 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-10-15 15:14:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-15 15:14:38,450 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2024-10-15 15:14:38,451 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2024-10-15 15:14:38,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-10-15 15:14:38,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-10-15 15:14:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-15 15:14:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-15 15:14:38,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-15 15:14:38,453 INFO L130 BoogieDeclarations]: Found specification of procedure plus [2024-10-15 15:14:38,454 INFO L138 BoogieDeclarations]: Found implementation of procedure plus [2024-10-15 15:14:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-15 15:14:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-15 15:14:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-10-15 15:14:38,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-10-15 15:14:38,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-15 15:14:38,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-15 15:14:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-15 15:14:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-15 15:14:38,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-15 15:14:38,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-15 15:14:38,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-15 15:14:38,782 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-15 15:14:38,782 INFO L287 CfgBuilder]: Performing block encoding [2024-10-15 15:14:38,808 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-15 15:14:38,809 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-15 15:14:38,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:38 BoogieIcfgContainer [2024-10-15 15:14:38,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-15 15:14:38,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-15 15:14:38,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-15 15:14:38,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-15 15:14:38,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:14:38" (1/3) ... [2024-10-15 15:14:38,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9d77c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:38, skipping insertion in model container [2024-10-15 15:14:38,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:14:38" (2/3) ... [2024-10-15 15:14:38,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9d77c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:14:38, skipping insertion in model container [2024-10-15 15:14:38,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:38" (3/3) ... [2024-10-15 15:14:38,821 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-recursive.c [2024-10-15 15:14:38,838 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-15 15:14:38,839 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-15 15:14:38,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-15 15:14:38,894 INFO L333 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;@1f3fa470, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-15 15:14:38,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-15 15:14:38,899 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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-10-15 15:14:38,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-15 15:14:38,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:38,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:38,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:38,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1580235901, now seen corresponding path program 1 times [2024-10-15 15:14:38,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:38,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845317223] [2024-10-15 15:14:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:39,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845317223] [2024-10-15 15:14:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845317223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-15 15:14:39,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-15 15:14:39,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-15 15:14:39,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048682783] [2024-10-15 15:14:39,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-15 15:14:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-15 15:14:39,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:39,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-15 15:14:39,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-15 15:14:39,406 INFO L87 Difference]: Start difference. First operand has 22 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 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 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-10-15 15:14:39,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:39,498 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-15 15:14:39,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-15 15:14:39,500 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-10-15 15:14:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:39,505 INFO L225 Difference]: With dead ends: 36 [2024-10-15 15:14:39,506 INFO L226 Difference]: Without dead ends: 17 [2024-10-15 15:14:39,508 INFO L431 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-10-15 15:14:39,511 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:39,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 63 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-15 15:14:39,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-15 15:14:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-15 15:14:39,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 5 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 15:14:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-10-15 15:14:39,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2024-10-15 15:14:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:39,551 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-10-15 15:14:39,552 INFO L472 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-10-15 15:14:39,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-10-15 15:14:39,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-15 15:14:39,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:39,554 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:39,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-15 15:14:39,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:39,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:39,557 INFO L85 PathProgramCache]: Analyzing trace with hash -33473928, now seen corresponding path program 1 times [2024-10-15 15:14:39,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:39,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141486986] [2024-10-15 15:14:39,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:39,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:39,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141486986] [2024-10-15 15:14:39,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141486986] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:39,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46553442] [2024-10-15 15:14:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:39,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:39,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:39,912 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-10-15 15:14:39,914 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-15 15:14:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:39,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-15 15:14:40,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:40,055 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-10-15 15:14:40,193 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-10-15 15:14:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:40,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:14:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:40,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46553442] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:14:40,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:14:40,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2024-10-15 15:14:40,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672305709] [2024-10-15 15:14:40,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:14:40,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-15 15:14:40,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-15 15:14:40,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2024-10-15 15:14:40,513 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 14 states have internal predecessors, (22), 9 states have call successors, (10), 9 states have call predecessors, (10), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 15:14:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:40,749 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2024-10-15 15:14:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-15 15:14:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 14 states have internal predecessors, (22), 9 states have call successors, (10), 9 states have call predecessors, (10), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-10-15 15:14:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:40,751 INFO L225 Difference]: With dead ends: 31 [2024-10-15 15:14:40,751 INFO L226 Difference]: Without dead ends: 27 [2024-10-15 15:14:40,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2024-10-15 15:14:40,752 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:40,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:40,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-15 15:14:40,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-15 15:14:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-10-15 15:14:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-15 15:14:40,758 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 15 [2024-10-15 15:14:40,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:40,759 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-15 15:14:40,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 14 states have internal predecessors, (22), 9 states have call successors, (10), 9 states have call predecessors, (10), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 15:14:40,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:40,759 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-15 15:14:40,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-15 15:14:40,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:40,760 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:40,778 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-15 15:14:40,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:40,965 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:40,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash -529350248, now seen corresponding path program 2 times [2024-10-15 15:14:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249798172] [2024-10-15 15:14:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:40,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:41,595 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:41,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:41,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249798172] [2024-10-15 15:14:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249798172] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285016061] [2024-10-15 15:14:41,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-15 15:14:41,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:41,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:41,598 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-10-15 15:14:41,600 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-15 15:14:41,673 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-15 15:14:41,673 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:14:41,677 WARN L253 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-10-15 15:14:41,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:41,693 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-10-15 15:14:41,775 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-10-15 15:14:41,795 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-10-15 15:14:41,826 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-10-15 15:14:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:41,862 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:14:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285016061] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:14:42,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:14:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 38 [2024-10-15 15:14:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200537239] [2024-10-15 15:14:42,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:14:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-15 15:14:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-15 15:14:42,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2024-10-15 15:14:42,286 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 38 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 22 states have internal predecessors, (34), 17 states have call successors, (18), 17 states have call predecessors, (18), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 15:14:42,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:42,776 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-15 15:14:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-15 15:14:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 22 states have internal predecessors, (34), 17 states have call successors, (18), 17 states have call predecessors, (18), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-10-15 15:14:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:42,778 INFO L225 Difference]: With dead ends: 51 [2024-10-15 15:14:42,778 INFO L226 Difference]: Without dead ends: 47 [2024-10-15 15:14:42,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=2751, Unknown=0, NotChecked=0, Total=3192 [2024-10-15 15:14:42,781 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 35 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:42,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 83 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:42,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-15 15:14:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-10-15 15:14:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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-10-15 15:14:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2024-10-15 15:14:42,791 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 25 [2024-10-15 15:14:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2024-10-15 15:14:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 22 states have internal predecessors, (34), 17 states have call successors, (18), 17 states have call predecessors, (18), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-15 15:14:42,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2024-10-15 15:14:42,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-15 15:14:42,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-15 15:14:42,794 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-15 15:14:42,811 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-15 15:14:42,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:42,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting fooErr0ASSERT_VIOLATIONERROR_FUNCTION === [fooErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-15 15:14:42,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:42,999 INFO L85 PathProgramCache]: Analyzing trace with hash -586901544, now seen corresponding path program 3 times [2024-10-15 15:14:43,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-15 15:14:43,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362787865] [2024-10-15 15:14:43,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-15 15:14:43,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-15 15:14:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:44,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-15 15:14:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-15 15:14:44,296 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-15 15:14:44,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-15 15:14:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362787865] [2024-10-15 15:14:44,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362787865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-15 15:14:44,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041661715] [2024-10-15 15:14:44,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-15 15:14:44,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:44,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-10-15 15:14:44,300 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-10-15 15:14:44,302 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-15 15:14:44,374 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-15 15:14:44,374 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-15 15:14:44,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-15 15:14:44,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-15 15:14:44,481 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-10-15 15:14:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-15 15:14:44,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-15 15:14:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-10-15 15:14:44,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041661715] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-15 15:14:44,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-15 15:14:44,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 9, 9] total 42 [2024-10-15 15:14:44,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556759284] [2024-10-15 15:14:44,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-15 15:14:44,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-15 15:14:44,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-15 15:14:44,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-15 15:14:44,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1510, Unknown=0, NotChecked=0, Total=1722 [2024-10-15 15:14:44,828 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 42 states, 32 states have (on average 1.28125) internal successors, (41), 25 states have internal predecessors, (41), 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-10-15 15:14:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-15 15:14:45,592 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2024-10-15 15:14:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-15 15:14:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 32 states have (on average 1.28125) internal successors, (41), 25 states have internal predecessors, (41), 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 45 [2024-10-15 15:14:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-15 15:14:45,593 INFO L225 Difference]: With dead ends: 53 [2024-10-15 15:14:45,593 INFO L226 Difference]: Without dead ends: 0 [2024-10-15 15:14:45,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=682, Invalid=3874, Unknown=0, NotChecked=0, Total=4556 [2024-10-15 15:14:45,596 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-15 15:14:45,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 66 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-15 15:14:45,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-15 15:14:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-15 15:14:45,597 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-10-15 15:14:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-15 15:14:45,598 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-10-15 15:14:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-15 15:14:45,598 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-15 15:14:45,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 32 states have (on average 1.28125) internal successors, (41), 25 states have internal predecessors, (41), 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-10-15 15:14:45,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-15 15:14:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-15 15:14:45,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-15 15:14:45,601 INFO L782 garLoopResultBuilder]: Registering result SAFE for location fooErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-15 15:14:45,619 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-15 15:14:45,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-15 15:14:45,805 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-15 15:14:45,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-15 15:14:46,601 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-15 15:14:46,617 WARN L156 FloydHoareUtils]: Requires clause for foo contained old-variable. Original clause: (let ((.cse0 (select (select |old(#memory_int#1)| |foo_#in~p.base|) |foo_#in~p.offset|)) (.cse1 (select (select |#memory_int#1| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (<= .cse0 20) (or (not (= .cse0 10)) (= .cse1 10)) (or (<= .cse1 16) (< 16 .cse0)) (or (< 12 .cse0) (<= .cse1 12)) (or (< 11 .cse0) (<= .cse1 11)) (or (<= .cse1 17) (< 17 .cse0)) (or (<= .cse1 14) (< 14 .cse0)) (<= .cse1 20) (or (<= .cse1 15) (< 15 .cse0)) (or (< 13 .cse0) (<= .cse1 13)))) Eliminated clause: (let ((.cse1 (select (select |#memory_int#1| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |old(#memory_int#1)| |foo_#in~p.base|) |foo_#in~p.offset|))) (and (or (< 13 .cse0) (< .cse1 14)) (or (< .cse1 13) (< 12 .cse0)) (or (< 17 .cse0) (< .cse1 18)) (<= .cse0 20) (or (not (= .cse0 10)) (= .cse1 10)) (or (< .cse1 15) (< 14 .cse0)) (or (< .cse1 16) (< 15 .cse0)) (or (< .cse1 17) (< 16 .cse0)) (or (< .cse1 12) (< 11 .cse0))))) (<= .cse1 20))) [2024-10-15 15:14:46,624 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-15 15:14:46,625 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:14:46,625 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 15:14:46,625 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-10-15 15:14:46,627 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:14:46,627 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-15 15:14:46,627 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-10-15 15:14:46,640 WARN L156 FloydHoareUtils]: Requires clause for plus contained old-variable. Original clause: (let ((.cse0 (select (select |old(#memory_int#1)| |plus_#in~p.base|) |plus_#in~p.offset|)) (.cse1 (select (select |#memory_int#1| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (< 13 .cse0) (<= .cse1 13)) (or (< 15 .cse0) (<= .cse1 15)) (or (<= .cse1 16) (< 16 .cse0)) (<= .cse0 19) (or (< 11 .cse0) (<= .cse1 11)) (or (not (= .cse0 10)) (= .cse1 10)) (<= .cse1 19) (or (< 12 .cse0) (<= .cse1 12)) (or (< 14 .cse0) (<= .cse1 14)))) Eliminated clause: (let ((.cse1 (select (select |#memory_int#1| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (exists ((|old(#memory_int#1)| (Array Int (Array Int Int)))) (let ((.cse0 (select (select |old(#memory_int#1)| |plus_#in~p.base|) |plus_#in~p.offset|))) (and (or (< 16 .cse0) (< .cse1 17)) (or (< .cse1 12) (< 11 .cse0)) (or (< .cse1 14) (< 13 .cse0)) (or (< 15 .cse0) (< .cse1 16)) (or (< 12 .cse0) (< .cse1 13)) (<= .cse0 19) (or (< 14 .cse0) (< .cse1 15)) (or (not (= .cse0 10)) (= .cse1 10))))) (<= .cse1 19))) [2024-10-15 15:14:46,642 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-15 15:14:46,642 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:14:46,643 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-15 15:14:46,643 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~p!base,]]] [2024-10-15 15:14:46,643 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-15 15:14:46,643 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-10-15 15:14:46,643 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~p!base,]]] [2024-10-15 15:14:46,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:14:46 BoogieIcfgContainer [2024-10-15 15:14:46,643 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-15 15:14:46,644 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-15 15:14:46,644 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-15 15:14:46,648 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-15 15:14:46,649 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:14:38" (3/4) ... [2024-10-15 15:14:46,651 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-15 15:14:46,707 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-10-15 15:14:46,708 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-15 15:14:46,709 INFO L158 Benchmark]: Toolchain (without parser) took 8661.97ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 136.8MB in the beginning and 198.9MB in the end (delta: -62.1MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-15 15:14:46,709 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:14:46,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.58ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 124.3MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:14:46,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.84ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 123.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-15 15:14:46,712 INFO L158 Benchmark]: Boogie Preprocessor took 35.03ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 122.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:14:46,712 INFO L158 Benchmark]: RCFGBuilder took 447.43ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 134.0MB in the end (delta: -11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-15 15:14:46,712 INFO L158 Benchmark]: TraceAbstraction took 7831.91ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 134.0MB in the beginning and 201.0MB in the end (delta: -66.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. [2024-10-15 15:14:46,713 INFO L158 Benchmark]: Witness Printer took 63.90ms. Allocated memory is still 251.7MB. Free memory was 201.0MB in the beginning and 198.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-15 15:14:46,714 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54ms. Allocated memory is still 109.1MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.58ms. Allocated memory is still 167.8MB. Free memory was 136.8MB in the beginning and 124.3MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.84ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 123.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.03ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 122.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 447.43ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 134.0MB in the end (delta: -11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7831.91ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 134.0MB in the beginning and 201.0MB in the end (delta: -66.9MB). Peak memory consumption was 145.9MB. Max. memory is 16.1GB. * Witness Printer took 63.90ms. Allocated memory is still 251.7MB. Free memory was 201.0MB in the beginning and 198.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - 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: Unknown variable: #memory_int#1 - 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: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - 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: Unknown variable: #memory_int#1 - 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 498 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 44 mSDtfsCounter, 498 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1812 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=3, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 180 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 39 NumberOfNonLiveVariables, 396 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 10 InterpolantComputations, 1 PerfectInterpolantSequences, 236/426 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-15 15:14:46,743 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