./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.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 d115e09498e3f278fd539730f0fa55e0745770e0304e10455a14000311085b68 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:13:47,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:13:47,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:13:47,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:13:47,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:13:47,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:13:47,170 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:13:47,171 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:13:47,171 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:13:47,172 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:13:47,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:13:47,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:13:47,173 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:13:47,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:13:47,174 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:13:47,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:13:47,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:13:47,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:13:47,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:13:47,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:13:47,176 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:13:47,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:13:47,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:13:47,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:13:47,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:13:47,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:13:47,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:13:47,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:13:47,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:13:47,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:13:47,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:13:47,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:13:47,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:13:47,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:13:47,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:13:47,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:13:47,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:13:47,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:13:47,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:13:47,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:13:47,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:13:47,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:13:47,183 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 -> d115e09498e3f278fd539730f0fa55e0745770e0304e10455a14000311085b68 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:13:47,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:13:47,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:13:47,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:13:47,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:13:47,525 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:13:47,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c [2024-09-25 00:13:49,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:13:49,398 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:13:49,399 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_nla-digbench/recursified_bresenham-ll.c [2024-09-25 00:13:49,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/d7e60e376/113e649ec3874317a9436c3e4ba1edbc/FLAG735c12a48 [2024-09-25 00:13:49,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/d7e60e376/113e649ec3874317a9436c3e4ba1edbc [2024-09-25 00:13:49,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:13:49,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:13:49,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:13:49,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:13:49,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:13:49,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:13:49" (1/1) ... [2024-09-25 00:13:49,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b8c743d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:49, skipping insertion in model container [2024-09-25 00:13:49,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:13:49" (1/1) ... [2024-09-25 00:13:49,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:13:50,013 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/recursified_nla-digbench/recursified_bresenham-ll.c[1137,1150] [2024-09-25 00:13:50,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:13:50,040 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:13:50,057 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/recursified_nla-digbench/recursified_bresenham-ll.c[1137,1150] [2024-09-25 00:13:50,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:13:50,081 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:13:50,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50 WrapperNode [2024-09-25 00:13:50,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:13:50,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:13:50,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:13:50,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:13:50,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,112 INFO L138 Inliner]: procedures = 16, calls = 76, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:13:50,112 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:13:50,113 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:13:50,113 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:13:50,113 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:13:50,124 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,144 INFO L175 MemorySlicer]: Split 46 memory accesses to 8 slices as follows [2, 8, 4, 7, 7, 8, 6, 4]. 17 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0, 0]. The 13 writes are split as follows [0, 3, 2, 2, 1, 1, 2, 2]. [2024-09-25 00:13:50,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,144 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,151 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:13:50,168 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:13:50,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:13:50,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:13:50,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (1/1) ... [2024-09-25 00:13:50,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:13:50,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:50,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:13:50,203 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:13:50,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:13:50,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:13:50,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:13:50,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:13:50,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 00:13:50,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-25 00:13:50,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-09-25 00:13:50,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-25 00:13:50,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-09-25 00:13:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-09-25 00:13:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-09-25 00:13:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-09-25 00:13:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-09-25 00:13:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:13:50,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:13:50,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:13:50,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 00:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 00:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-25 00:13:50,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-09-25 00:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-09-25 00:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-09-25 00:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-09-25 00:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-09-25 00:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_0_to_41_0 [2024-09-25 00:13:50,261 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_0_to_41_0 [2024-09-25 00:13:50,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:13:50,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:13:50,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:13:50,356 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:13:50,359 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:13:50,628 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-25 00:13:50,628 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:13:50,648 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:13:50,648 INFO L317 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-25 00:13:50,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:13:50 BoogieIcfgContainer [2024-09-25 00:13:50,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:13:50,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:13:50,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:13:50,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:13:50,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:13:49" (1/3) ... [2024-09-25 00:13:50,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64880bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:13:50, skipping insertion in model container [2024-09-25 00:13:50,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:13:50" (2/3) ... [2024-09-25 00:13:50,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64880bb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:13:50, skipping insertion in model container [2024-09-25 00:13:50,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:13:50" (3/3) ... [2024-09-25 00:13:50,656 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_bresenham-ll.c [2024-09-25 00:13:50,672 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:13:50,672 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:13:50,740 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:13:50,752 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;@5a5a31e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:13:50,752 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:13:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 00:13:50,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 00:13:50,764 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:13:50,766 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:13:50,766 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:13:50,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:50,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1584617207, now seen corresponding path program 1 times [2024-09-25 00:13:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:13:50,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132173824] [2024-09-25 00:13:50,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:13:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:13:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121655777] [2024-09-25 00:13:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:51,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:51,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:51,007 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:13:51,008 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 00:13:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:51,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-09-25 00:13:51,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:13:51,302 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-25 00:13:51,307 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 11 treesize of output 7 [2024-09-25 00:13:51,341 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-25 00:13:51,347 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 11 treesize of output 7 [2024-09-25 00:13:51,359 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 25 treesize of output 19 [2024-09-25 00:13:51,498 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 27 treesize of output 19 [2024-09-25 00:13:51,507 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 23 treesize of output 15 [2024-09-25 00:13:51,512 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 19 treesize of output 11 [2024-09-25 00:13:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:13:51,579 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:13:51,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:13:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132173824] [2024-09-25 00:13:51,580 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:13:51,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121655777] [2024-09-25 00:13:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121655777] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:13:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:13:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-25 00:13:51,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812371512] [2024-09-25 00:13:51,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:13:51,596 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 00:13:51,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:13:51,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 00:13:51,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-25 00:13:51,622 INFO L87 Difference]: Start difference. First operand has 28 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-25 00:13:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:13:51,897 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-09-25 00:13:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 00:13:51,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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 12 [2024-09-25 00:13:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:13:51,908 INFO L225 Difference]: With dead ends: 63 [2024-09-25 00:13:51,908 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 00:13:51,913 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 00:13:51,916 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:13:51,917 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:13:51,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 00:13:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-09-25 00:13:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-25 00:13:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-25 00:13:51,963 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 12 [2024-09-25 00:13:51,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:13:51,963 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-25 00:13:51,964 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-25 00:13:51,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:51,965 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-25 00:13:51,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 00:13:51,965 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:13:51,966 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:13:51,984 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 00:13:52,169 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-09-25 00:13:52,170 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:13:52,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash 404436698, now seen corresponding path program 1 times [2024-09-25 00:13:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:13:52,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780770889] [2024-09-25 00:13:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:13:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:13:52,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1978983048] [2024-09-25 00:13:52,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:52,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:52,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:52,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:13:52,335 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 00:13:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:52,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-25 00:13:52,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:13:52,487 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 11 treesize of output 7 [2024-09-25 00:13:52,491 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 25 treesize of output 19 [2024-09-25 00:13:52,503 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 11 treesize of output 7 [2024-09-25 00:13:52,546 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 19 treesize of output 15 [2024-09-25 00:13:52,652 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 27 treesize of output 19 [2024-09-25 00:13:52,660 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 23 treesize of output 15 [2024-09-25 00:13:52,668 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 19 treesize of output 11 [2024-09-25 00:13:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:13:52,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 00:13:52,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:13:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780770889] [2024-09-25 00:13:52,710 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:13:52,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978983048] [2024-09-25 00:13:52,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978983048] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:13:52,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:13:52,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 00:13:52,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487300776] [2024-09-25 00:13:52,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:13:52,713 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:13:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:13:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:13:52,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:13:52,715 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 00:13:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:13:53,026 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2024-09-25 00:13:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:13:53,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2024-09-25 00:13:53,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:13:53,028 INFO L225 Difference]: With dead ends: 45 [2024-09-25 00:13:53,028 INFO L226 Difference]: Without dead ends: 35 [2024-09-25 00:13:53,028 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-25 00:13:53,029 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:13:53,029 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 51 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:13:53,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-25 00:13:53,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-25 00:13:53,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-25 00:13:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-25 00:13:53,036 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2024-09-25 00:13:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:13:53,037 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-25 00:13:53,037 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 00:13:53,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:53,037 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-25 00:13:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-25 00:13:53,038 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:13:53,038 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:13:53,051 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:13:53,238 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:53,239 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:13:53,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:53,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1939087400, now seen corresponding path program 1 times [2024-09-25 00:13:53,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:13:53,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422156091] [2024-09-25 00:13:53,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:53,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:13:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:13:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611396194] [2024-09-25 00:13:53,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:53,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:53,331 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-25 00:13:53,332 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-25 00:13:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:53,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-09-25 00:13:53,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:13:53,498 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 11 treesize of output 7 [2024-09-25 00:13:53,504 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 25 treesize of output 19 [2024-09-25 00:13:53,511 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-25 00:13:53,515 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 11 treesize of output 7 [2024-09-25 00:13:53,522 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-25 00:13:53,710 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 43 treesize of output 31 [2024-09-25 00:13:57,816 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 19 treesize of output 11 [2024-09-25 00:13:57,910 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 27 treesize of output 19 [2024-09-25 00:13:57,914 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 23 treesize of output 15 [2024-09-25 00:13:57,917 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 26 treesize of output 14 [2024-09-25 00:13:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 00:13:57,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:13:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:13:58,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:13:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422156091] [2024-09-25 00:13:58,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:13:58,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611396194] [2024-09-25 00:13:58,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [611396194] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:13:58,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:13:58,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2024-09-25 00:13:58,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734493157] [2024-09-25 00:13:58,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:13:58,224 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 00:13:58,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:13:58,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 00:13:58,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=230, Unknown=1, NotChecked=0, Total=272 [2024-09-25 00:13:58,226 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 00:13:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:13:58,841 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-09-25 00:13:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 00:13:58,841 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-09-25 00:13:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:13:58,842 INFO L225 Difference]: With dead ends: 56 [2024-09-25 00:13:58,843 INFO L226 Difference]: Without dead ends: 52 [2024-09-25 00:13:58,843 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=103, Invalid=546, Unknown=1, NotChecked=0, Total=650 [2024-09-25 00:13:58,844 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 00:13:58,844 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 130 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 00:13:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-09-25 00:13:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2024-09-25 00:13:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-25 00:13:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2024-09-25 00:13:58,867 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 24 [2024-09-25 00:13:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:13:58,868 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2024-09-25 00:13:58,868 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 8 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 00:13:58,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2024-09-25 00:13:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 00:13:58,869 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:13:58,869 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:13:58,882 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 00:13:59,073 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-09-25 00:13:59,074 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:13:59,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:13:59,074 INFO L85 PathProgramCache]: Analyzing trace with hash 674694001, now seen corresponding path program 1 times [2024-09-25 00:13:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:13:59,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172612483] [2024-09-25 00:13:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:59,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:13:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:13:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551820896] [2024-09-25 00:13:59,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:13:59,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:13:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:13:59,128 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-25 00:13:59,129 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-25 00:13:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:13:59,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 156 conjuncts are in the unsatisfiable core [2024-09-25 00:13:59,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:13:59,268 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 25 treesize of output 19 [2024-09-25 00:13:59,274 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-25 00:13:59,278 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 11 treesize of output 7 [2024-09-25 00:13:59,283 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 11 treesize of output 7 [2024-09-25 00:13:59,290 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-25 00:13:59,302 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 19 treesize of output 15 [2024-09-25 00:13:59,857 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 40 treesize of output 17 [2024-09-25 00:13:59,860 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 13 treesize of output 9 [2024-09-25 00:13:59,918 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-25 00:13:59,951 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-25 00:14:13,064 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 52 treesize of output 36 [2024-09-25 00:14:13,076 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 23 treesize of output 3 [2024-09-25 00:14:13,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:14:13,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 59 [2024-09-25 00:14:13,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:14:13,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 89 [2024-09-25 00:14:13,265 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 96 treesize of output 72 [2024-09-25 00:14:13,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:14:13,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2024-09-25 00:14:13,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:14:13,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 48 [2024-09-25 00:14:13,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:14:13,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2024-09-25 00:14:13,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:14:13,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-09-25 00:14:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-25 00:14:19,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:14:39,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:14:39,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172612483] [2024-09-25 00:14:39,279 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:14:39,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551820896] [2024-09-25 00:14:39,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551820896] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:14:39,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:14:39,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2024-09-25 00:14:39,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323274270] [2024-09-25 00:14:39,279 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 00:14:39,280 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 00:14:39,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:14:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 00:14:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=481, Unknown=3, NotChecked=0, Total=552 [2024-09-25 00:14:39,281 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 00:14:43,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:14:47,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:14:53,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:14:57,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:15:01,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:15:04,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:15:09,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:15:13,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:15:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:15:13,943 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-09-25 00:15:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-25 00:15:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2024-09-25 00:15:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:15:13,946 INFO L225 Difference]: With dead ends: 59 [2024-09-25 00:15:13,946 INFO L226 Difference]: Without dead ends: 49 [2024-09-25 00:15:13,947 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 34.6s TimeCoverageRelationStatistics Valid=164, Invalid=1165, Unknown=3, NotChecked=0, Total=1332 [2024-09-25 00:15:13,948 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 11 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-09-25 00:15:13,948 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 66 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 376 Invalid, 7 Unknown, 0 Unchecked, 32.4s Time] [2024-09-25 00:15:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-25 00:15:13,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-25 00:15:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2024-09-25 00:15:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2024-09-25 00:15:13,974 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 36 [2024-09-25 00:15:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:15:13,974 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2024-09-25 00:15:13,975 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 00:15:13,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:15:13,975 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2024-09-25 00:15:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 00:15:13,976 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:15:13,976 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:15:13,998 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 00:15:14,180 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:15:14,181 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:15:14,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:15:14,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1097395827, now seen corresponding path program 1 times [2024-09-25 00:15:14,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:15:14,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633288619] [2024-09-25 00:15:14,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:15:14,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:15:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:15:14,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [654849027] [2024-09-25 00:15:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:15:14,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:15:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:15:14,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:15:14,269 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 00:15:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:15:14,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 162 conjuncts are in the unsatisfiable core [2024-09-25 00:15:14,447 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:15:14,452 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-25 00:15:14,454 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 11 treesize of output 7 [2024-09-25 00:15:14,458 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 11 treesize of output 7 [2024-09-25 00:15:14,463 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-25 00:15:14,466 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 25 treesize of output 19 [2024-09-25 00:15:14,486 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 19 treesize of output 15 [2024-09-25 00:15:15,163 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 11 treesize of output 7 [2024-09-25 00:15:15,236 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 21 treesize of output 17 [2024-09-25 00:15:15,262 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-25 00:15:19,357 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_6| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_6| Int) (func_to_recursive_line_0_to_41_0_~xy.base Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_6| Int) (func_to_recursive_line_0_to_41_0_~xy.offset Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_int#2| func_to_recursive_line_0_to_41_0_~xy.base) func_to_recursive_line_0_to_41_0_~xy.offset) (* (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_6|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_6|) (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_6|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_6|)))) is different from true [2024-09-25 00:15:20,035 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 19 treesize of output 11 [2024-09-25 00:15:20,042 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 19 treesize of output 11 [2024-09-25 00:15:20,056 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 57 treesize of output 42 [2024-09-25 00:15:20,163 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 21 treesize of output 17 [2024-09-25 00:15:20,168 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 58 treesize of output 38 [2024-09-25 00:15:20,174 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 39 treesize of output 23 [2024-09-25 00:15:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2024-09-25 00:15:20,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:15:29,260 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 88 treesize of output 72 [2024-09-25 00:15:29,269 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 72 treesize of output 68 [2024-09-25 00:15:29,277 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 68 treesize of output 56 [2024-09-25 00:15:33,969 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int#4| |c_func_to_recursive_line_0_to_41_0_#in~X.base|) |c_func_to_recursive_line_0_to_41_0_#in~X.offset|)) (.cse1 (forall ((|v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7| Int)) (let ((.cse9 (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_7|)) (.cse10 (select (select |c_#memory_int#3| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7|))) (= (+ (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7|) (select (select |c_#memory_int#1| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_7|) (* (* .cse9 .cse10) 2)) (let ((.cse11 (select (select |c_#memory_int#5| |v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_7|))) (+ (* 2 .cse11) (* .cse9 2) (* 2 (* .cse11 .cse10))))))))) (and (or (< .cse0 (select (select |c_old(#memory_int#3)| |c_func_to_recursive_line_0_to_41_0_#in~x.base|) |c_func_to_recursive_line_0_to_41_0_#in~x.offset|)) .cse1) (or (= (mod (+ .cse0 (select (select |c_old(#memory_int#1)| |c_func_to_recursive_line_0_to_41_0_#in~v.base|) |c_func_to_recursive_line_0_to_41_0_#in~v.offset|)) 2) 0) .cse1) (forall ((|v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_7| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7| Int)) (let ((.cse4 (select (select |c_#memory_int#5| |v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_7|))) (let ((.cse6 (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_7|)) (.cse3 (* 2 .cse4))) (or (not (let ((.cse2 (select (select |c_old(#memory_int#6)| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_7|)) (.cse5 (select (select |c_old(#memory_int#3)| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7|))) (= (+ (* .cse2 2) .cse3 (* (* .cse4 .cse5) 2)) (+ (select (select |c_old(#memory_int#1)| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_7|) (* 2 (* .cse2 .cse5)) .cse6)))) (let ((.cse7 (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_7|)) (.cse8 (select (select |c_#memory_int#3| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_7|))) (= (+ .cse6 (select (select |c_#memory_int#1| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_7|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_7|) (* (* .cse7 .cse8) 2)) (+ .cse3 (* .cse7 2) (* 2 (* .cse4 .cse8))))))))))) is different from false [2024-09-25 00:15:44,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:15:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633288619] [2024-09-25 00:15:44,106 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:15:44,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654849027] [2024-09-25 00:15:44,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654849027] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:15:44,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:15:44,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2024-09-25 00:15:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480111976] [2024-09-25 00:15:44,107 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 00:15:44,108 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 00:15:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:15:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 00:15:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=672, Unknown=3, NotChecked=106, Total=870 [2024-09-25 00:15:44,109 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 00:16:15,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-09-25 00:16:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:16:19,284 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-09-25 00:16:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-25 00:16:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2024-09-25 00:16:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:16:19,288 INFO L225 Difference]: With dead ends: 57 [2024-09-25 00:16:19,288 INFO L226 Difference]: Without dead ends: 51 [2024-09-25 00:16:19,289 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=170, Invalid=1317, Unknown=3, NotChecked=150, Total=1640 [2024-09-25 00:16:19,290 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-09-25 00:16:19,290 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 82 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 454 Invalid, 0 Unknown, 40 Unchecked, 14.0s Time] [2024-09-25 00:16:19,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-09-25 00:16:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-09-25 00:16:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 7 states have call successors, (10) [2024-09-25 00:16:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2024-09-25 00:16:19,317 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 36 [2024-09-25 00:16:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:16:19,317 INFO L474 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2024-09-25 00:16:19,317 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 00:16:19,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:16:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2024-09-25 00:16:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-25 00:16:19,319 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:16:19,319 INFO L216 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:16:19,338 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 00:16:19,519 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:16:19,521 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:16:19,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:16:19,521 INFO L85 PathProgramCache]: Analyzing trace with hash 18206728, now seen corresponding path program 2 times [2024-09-25 00:16:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:16:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433392983] [2024-09-25 00:16:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:16:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:16:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-25 00:16:19,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621649714] [2024-09-25 00:16:19,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:16:19,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:16:19,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:16:19,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 00:16:19,600 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 00:16:19,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:16:19,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:16:19,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 212 conjuncts are in the unsatisfiable core [2024-09-25 00:16:19,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:16:19,875 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 25 treesize of output 19 [2024-09-25 00:16:19,976 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-25 00:16:20,029 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-25 00:16:20,081 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 11 treesize of output 7 [2024-09-25 00:16:20,181 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 11 treesize of output 7 [2024-09-25 00:16:20,579 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 19 treesize of output 15 [2024-09-25 00:16:37,223 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 11 treesize of output 7 [2024-09-25 00:16:37,968 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-25 00:16:38,229 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-25 00:16:43,999 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_12| Int) (func_to_recursive_line_0_to_41_0_~xy.base Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_12| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_12| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_12| Int) (func_to_recursive_line_0_to_41_0_~xy.offset Int)) (<= (select (select |c_#memory_int#2| func_to_recursive_line_0_to_41_0_~xy.base) func_to_recursive_line_0_to_41_0_~xy.offset) (* (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_12|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_12|) (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_12|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_12|)))) (exists ((|v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_12| Int) (func_to_recursive_line_0_to_41_0_~yx.base Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_12| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_12| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_12| Int) (func_to_recursive_line_0_to_41_0_~yx.offset Int)) (<= (* (select (select |c_#memory_int#3| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_12|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_12|) (select (select |c_#memory_int#5| |v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_12|) |v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_12|)) (select (select |c_#memory_int#7| func_to_recursive_line_0_to_41_0_~yx.base) func_to_recursive_line_0_to_41_0_~yx.offset)))) is different from true [2024-09-25 00:16:56,627 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 43 treesize of output 31 [2024-09-25 00:16:56,943 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 19 treesize of output 11 [2024-09-25 00:16:58,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:16:58,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2024-09-25 00:16:58,847 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 49 treesize of output 37 [2024-09-25 00:16:59,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:16:59,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2024-09-25 00:16:59,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:16:59,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 60 [2024-09-25 00:16:59,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:16:59,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-09-25 00:16:59,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:16:59,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2024-09-25 00:17:00,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:17:00,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2024-09-25 00:17:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 1 not checked. [2024-09-25 00:17:03,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:17:59,583 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 114 treesize of output 102 [2024-09-25 00:17:59,659 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 102 treesize of output 86 [2024-09-25 00:17:59,772 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 86 treesize of output 78 [2024-09-25 00:18:04,491 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_old(#memory_int#3)| |c_func_to_recursive_line_0_to_41_0_#in~x.base|)) (.cse13 (select |c_old(#memory_int#1)| |c_func_to_recursive_line_0_to_41_0_#in~v.base|)) (.cse2 (select (select |c_#memory_int#5| |c_func_to_recursive_line_0_to_41_0_#in~Y.base|) |c_func_to_recursive_line_0_to_41_0_#in~Y.offset|))) (let ((.cse5 (forall ((|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_13| Int)) (let ((.cse15 (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_13|)) (.cse16 (select (select |c_#memory_int#3| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_13|))) (= (+ (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_13|) (* 2 (* .cse15 .cse16)) (select (select |c_#memory_int#1| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_13|)) (let ((.cse17 (select (select |c_#memory_int#5| |v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_13|))) (+ (* .cse15 2) (* .cse17 2) (* (* .cse17 .cse16) 2))))))) (.cse3 (select (select |c_#memory_int#4| |c_func_to_recursive_line_0_to_41_0_#in~X.base|) |c_func_to_recursive_line_0_to_41_0_#in~X.offset|)) (.cse0 (* 2 .cse2)) (.cse4 (select .cse13 |c_func_to_recursive_line_0_to_41_0_#in~v.offset|)) (.cse1 (select .cse14 |c_func_to_recursive_line_0_to_41_0_#in~x.offset|))) (and (or (< (+ .cse0 (* (* .cse1 .cse2) 2)) (+ .cse3 .cse4 (* 2 (* .cse3 (select (select |c_old(#memory_int#6)| |c_func_to_recursive_line_0_to_41_0_#in~y.base|) |c_func_to_recursive_line_0_to_41_0_#in~y.offset|))) 1)) .cse5) (or .cse5 (= .cse1 .cse3)) (forall ((|v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_13| Int) (|v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_13| Int)) (let ((.cse10 (select (select |c_#memory_int#5| |v_func_to_recursive_line_0_to_41_0_#in~Y.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~Y.offset_BEFORE_CALL_13|))) (let ((.cse9 (* .cse10 2)) (.cse6 (select (select |c_#memory_int#4| |v_func_to_recursive_line_0_to_41_0_#in~X.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~X.offset_BEFORE_CALL_13|))) (or (let ((.cse7 (select (select |c_#memory_int#6| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_13|)) (.cse8 (select (select |c_#memory_int#3| |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_13|))) (= (+ .cse6 (* 2 (* .cse7 .cse8)) (select (select |c_#memory_int#1| |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_13|)) (+ (* .cse7 2) .cse9 (* (* .cse10 .cse8) 2)))) (not (let ((.cse11 (select (select (store |c_old(#memory_int#3)| |c_func_to_recursive_line_0_to_41_0_#in~x.base| (store .cse14 |c_func_to_recursive_line_0_to_41_0_#in~x.offset| (+ .cse1 1))) |v_func_to_recursive_line_0_to_41_0_#in~x.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~x.offset_BEFORE_CALL_13|)) (.cse12 (select (select |c_old(#memory_int#6)| |v_func_to_recursive_line_0_to_41_0_#in~y.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~y.offset_BEFORE_CALL_13|))) (= (+ (* 2 (* .cse11 .cse10)) .cse9 (* 2 .cse12)) (+ (select (select (store |c_old(#memory_int#1)| |c_func_to_recursive_line_0_to_41_0_#in~v.base| (store .cse13 |c_func_to_recursive_line_0_to_41_0_#in~v.offset| (+ .cse0 .cse4))) |v_func_to_recursive_line_0_to_41_0_#in~v.base_BEFORE_CALL_13|) |v_func_to_recursive_line_0_to_41_0_#in~v.offset_BEFORE_CALL_13|) .cse6 (* 2 (* .cse11 .cse12))))))))))))) is different from false [2024-09-25 00:18:14,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:18:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433392983] [2024-09-25 00:18:14,194 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-25 00:18:14,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621649714] [2024-09-25 00:18:14,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621649714] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:18:14,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-09-25 00:18:14,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2024-09-25 00:18:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318854328] [2024-09-25 00:18:14,195 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-09-25 00:18:14,195 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 00:18:14,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:18:14,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 00:18:14,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=736, Unknown=2, NotChecked=110, Total=930 [2024-09-25 00:18:14,200 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)