./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_rec.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/verifythis/prefixsum_rec.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-25 00:09:50,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 00:09:50,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 00:09:50,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 00:09:50,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 00:09:50,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 00:09:50,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 00:09:50,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 00:09:50,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 00:09:50,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 00:09:50,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 00:09:50,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 00:09:50,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 00:09:50,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 00:09:50,377 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 00:09:50,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 00:09:50,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 00:09:50,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 00:09:50,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 00:09:50,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 00:09:50,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 00:09:50,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 00:09:50,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 00:09:50,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 00:09:50,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 00:09:50,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 00:09:50,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 00:09:50,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 00:09:50,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 00:09:50,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 00:09:50,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 00:09:50,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 00:09:50,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:50,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 00:09:50,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 00:09:50,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 00:09:50,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 00:09:50,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 00:09:50,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 00:09:50,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 00:09:50,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 00:09:50,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 00:09:50,386 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 -> 81bdf17d0130e934dcb31a2f76f595e947b99d6273334b7f05365a624466aeab Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 00:09:50,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 00:09:50,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 00:09:50,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 00:09:50,742 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 00:09:50,743 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 00:09:50,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/prefixsum_rec.c [2024-09-25 00:09:52,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 00:09:52,475 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 00:09:52,477 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/prefixsum_rec.c [2024-09-25 00:09:52,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8334cdceb/10861d7dc7064d4397ef245a5d6a5fad/FLAG1fda65f46 [2024-09-25 00:09:52,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8334cdceb/10861d7dc7064d4397ef245a5d6a5fad [2024-09-25 00:09:52,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 00:09:52,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 00:09:52,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:52,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 00:09:52,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 00:09:52,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31d51a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52, skipping insertion in model container [2024-09-25 00:09:52,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 00:09:52,709 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2024-09-25 00:09:52,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:52,752 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 00:09:52,767 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/prefixsum_rec.c[525,538] [2024-09-25 00:09:52,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 00:09:52,819 INFO L204 MainTranslator]: Completed translation [2024-09-25 00:09:52,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52 WrapperNode [2024-09-25 00:09:52,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 00:09:52,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:52,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 00:09:52,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 00:09:52,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,852 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 00:09:52,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 00:09:52,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 00:09:52,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 00:09:52,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 00:09:52,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,873 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,896 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-09-25 00:09:52,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,915 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 00:09:52,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 00:09:52,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 00:09:52,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 00:09:52,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (1/1) ... [2024-09-25 00:09:52,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 00:09:52,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:52,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 00:09:52,987 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 00:09:53,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 00:09:53,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 00:09:53,032 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 00:09:53,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 00:09:53,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 00:09:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 00:09:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-25 00:09:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure check [2024-09-25 00:09:53,033 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2024-09-25 00:09:53,033 INFO L130 BoogieDeclarations]: Found specification of procedure downsweep [2024-09-25 00:09:53,033 INFO L138 BoogieDeclarations]: Found implementation of procedure downsweep [2024-09-25 00:09:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-25 00:09:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-25 00:09:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 00:09:53,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 00:09:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-25 00:09:53,034 INFO L130 BoogieDeclarations]: Found specification of procedure is_pow2 [2024-09-25 00:09:53,034 INFO L138 BoogieDeclarations]: Found implementation of procedure is_pow2 [2024-09-25 00:09:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure upsweep [2024-09-25 00:09:53,035 INFO L138 BoogieDeclarations]: Found implementation of procedure upsweep [2024-09-25 00:09:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 00:09:53,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 00:09:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-25 00:09:53,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-25 00:09:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-25 00:09:53,036 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-25 00:09:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 00:09:53,036 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 00:09:53,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-25 00:09:53,139 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 00:09:53,141 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 00:09:53,497 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-09-25 00:09:53,498 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 00:09:53,536 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 00:09:53,536 INFO L317 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-25 00:09:53,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:53 BoogieIcfgContainer [2024-09-25 00:09:53,539 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 00:09:53,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 00:09:53,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 00:09:53,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 00:09:53,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 12:09:52" (1/3) ... [2024-09-25 00:09:53,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf7f223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:53, skipping insertion in model container [2024-09-25 00:09:53,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 12:09:52" (2/3) ... [2024-09-25 00:09:53,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf7f223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 12:09:53, skipping insertion in model container [2024-09-25 00:09:53,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 12:09:53" (3/3) ... [2024-09-25 00:09:53,553 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_rec.c [2024-09-25 00:09:53,571 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 00:09:53,572 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 00:09:53,630 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 00:09:53,638 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;@2974efd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 00:09:53,638 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 00:09:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-25 00:09:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 00:09:53,655 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:53,655 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:53,656 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:53,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1461914549, now seen corresponding path program 1 times [2024-09-25 00:09:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147311616] [2024-09-25 00:09:53,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:53,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:53,937 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:53,944 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:09:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:53,957 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:09:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:53,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:09:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:53,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 00:09:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,005 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 00:09:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:09:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:09:54,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147311616] [2024-09-25 00:09:54,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147311616] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:54,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:09:54,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 00:09:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705061434] [2024-09-25 00:09:54,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:54,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 00:09:54,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 00:09:54,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:09:54,091 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 9 states have call predecessors, (15), 9 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 00:09:54,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:54,257 INFO L93 Difference]: Finished difference Result 113 states and 147 transitions. [2024-09-25 00:09:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 00:09:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-09-25 00:09:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:54,269 INFO L225 Difference]: With dead ends: 113 [2024-09-25 00:09:54,269 INFO L226 Difference]: Without dead ends: 54 [2024-09-25 00:09:54,274 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 00:09:54,280 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:54,281 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 57 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:54,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-25 00:09:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-09-25 00:09:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 00:09:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2024-09-25 00:09:54,334 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 49 [2024-09-25 00:09:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:54,335 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2024-09-25 00:09:54,336 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 00:09:54,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2024-09-25 00:09:54,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-25 00:09:54,341 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:54,341 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:54,341 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 00:09:54,342 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:54,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1883306379, now seen corresponding path program 1 times [2024-09-25 00:09:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:54,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743013439] [2024-09-25 00:09:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,747 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,760 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:09:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:09:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:09:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 00:09:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,799 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-25 00:09:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-09-25 00:09:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:09:54,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:54,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743013439] [2024-09-25 00:09:54,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743013439] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 00:09:54,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 00:09:54,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-25 00:09:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618318070] [2024-09-25 00:09:54,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 00:09:54,854 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-25 00:09:54,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:54,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-25 00:09:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-25 00:09:54,858 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 00:09:55,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:55,082 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2024-09-25 00:09:55,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 00:09:55,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 49 [2024-09-25 00:09:55,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:55,086 INFO L225 Difference]: With dead ends: 70 [2024-09-25 00:09:55,088 INFO L226 Difference]: Without dead ends: 55 [2024-09-25 00:09:55,089 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:09:55,091 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:55,092 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 184 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 00:09:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-25 00:09:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-09-25 00:09:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 00:09:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-09-25 00:09:55,114 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 49 [2024-09-25 00:09:55,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:55,116 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-09-25 00:09:55,116 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-09-25 00:09:55,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-09-25 00:09:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-25 00:09:55,118 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:55,120 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:55,121 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 00:09:55,121 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:55,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -644922402, now seen corresponding path program 1 times [2024-09-25 00:09:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536122990] [2024-09-25 00:09:55,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,393 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:55,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:09:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:09:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:09:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 00:09:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-25 00:09:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 00:09:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:09:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536122990] [2024-09-25 00:09:55,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536122990] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373363247] [2024-09-25 00:09:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:55,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:55,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:55,515 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:09:55,517 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:09:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:55,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 00:09:55,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:55,795 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:09:55,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:09:55,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-25 00:09:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373363247] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 00:09:55,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 00:09:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2024-09-25 00:09:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846308085] [2024-09-25 00:09:55,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 00:09:55,933 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 00:09:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:09:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 00:09:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-09-25 00:09:55,935 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-09-25 00:09:56,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:09:56,136 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2024-09-25 00:09:56,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 00:09:56,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 50 [2024-09-25 00:09:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:09:56,139 INFO L225 Difference]: With dead ends: 84 [2024-09-25 00:09:56,139 INFO L226 Difference]: Without dead ends: 56 [2024-09-25 00:09:56,140 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-09-25 00:09:56,141 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 00:09:56,141 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 156 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 00:09:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-09-25 00:09:56,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-09-25 00:09:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 15 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-09-25 00:09:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-09-25 00:09:56,155 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 50 [2024-09-25 00:09:56,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:09:56,155 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-09-25 00:09:56,155 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-09-25 00:09:56,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-09-25 00:09:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-25 00:09:56,159 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:09:56,159 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:09:56,180 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 00:09:56,360 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:56,360 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:09:56,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:09:56,361 INFO L85 PathProgramCache]: Analyzing trace with hash -909724779, now seen corresponding path program 2 times [2024-09-25 00:09:56,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:09:56,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196244357] [2024-09-25 00:09:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:09:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:09:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,400 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:09:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:09:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:09:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,410 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:09:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:09:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 00:09:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 00:09:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:58,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-25 00:09:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:09:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:09:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:09:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196244357] [2024-09-25 00:09:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196244357] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:09:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871319023] [2024-09-25 00:09:59,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 00:09:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:09:59,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:09:59,465 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:09:59,476 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:09:59,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 00:09:59,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 00:09:59,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-09-25 00:09:59,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:09:59,748 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 13 treesize of output 9 [2024-09-25 00:09:59,899 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_downsweep_~left_9 Int)) (and (<= |c_downsweep_#in~right| (+ v_downsweep_~left_9 1)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_downsweep_#in~a.base| (let ((.cse0 (select |c_old(#memory_int#1)| |c_downsweep_#in~a.base|)) (.cse1 (+ |c_downsweep_#in~a.offset| (* |c_downsweep_#in~right| 4)))) (store (store .cse0 .cse1 (select (select |c_#memory_int#1| |c_downsweep_#in~a.base|) .cse1)) (+ |c_downsweep_#in~a.offset| (* v_downsweep_~left_9 4)) (select .cse0 .cse1))))) (<= v_downsweep_~left_9 |c_downsweep_#in~left|))) is different from true [2024-09-25 00:09:59,936 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 32 treesize of output 11 [2024-09-25 00:10:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-25 00:10:00,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:10:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871319023] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:00,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:10:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 36 [2024-09-25 00:10:00,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197447468] [2024-09-25 00:10:00,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:10:00,711 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-25 00:10:00,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:00,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-25 00:10:00,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1370, Unknown=1, NotChecked=74, Total=1560 [2024-09-25 00:10:00,717 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 36 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 27 states have internal predecessors, (47), 11 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-25 00:10:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:03,426 INFO L93 Difference]: Finished difference Result 91 states and 119 transitions. [2024-09-25 00:10:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-25 00:10:03,426 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 27 states have internal predecessors, (47), 11 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) Word has length 51 [2024-09-25 00:10:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:03,430 INFO L225 Difference]: With dead ends: 91 [2024-09-25 00:10:03,430 INFO L226 Difference]: Without dead ends: 89 [2024-09-25 00:10:03,432 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=322, Invalid=3341, Unknown=1, NotChecked=118, Total=3782 [2024-09-25 00:10:03,432 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 115 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:03,433 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 373 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1332 Invalid, 0 Unknown, 115 Unchecked, 1.4s Time] [2024-09-25 00:10:03,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-25 00:10:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2024-09-25 00:10:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 41 states have (on average 1.146341463414634) internal successors, (47), 44 states have internal predecessors, (47), 19 states have call successors, (19), 11 states have call predecessors, (19), 10 states have return successors, (24), 15 states have call predecessors, (24), 16 states have call successors, (24) [2024-09-25 00:10:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2024-09-25 00:10:03,462 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 51 [2024-09-25 00:10:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:03,463 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2024-09-25 00:10:03,463 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 27 states have internal predecessors, (47), 11 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-09-25 00:10:03,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:03,464 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2024-09-25 00:10:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-25 00:10:03,469 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:03,469 INFO L216 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:03,488 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 00:10:03,673 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:03,674 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:03,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:03,674 INFO L85 PathProgramCache]: Analyzing trace with hash 151098671, now seen corresponding path program 1 times [2024-09-25 00:10:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634740888] [2024-09-25 00:10:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:03,880 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:03,886 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:03,888 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:10:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:03,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-25 00:10:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:04,009 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-09-25 00:10:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:04,014 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-25 00:10:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:04,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-25 00:10:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:04,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-25 00:10:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:04,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-25 00:10:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:04,037 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-25 00:10:04,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:04,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634740888] [2024-09-25 00:10:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634740888] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:04,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387787497] [2024-09-25 00:10:04,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:04,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:04,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:04,041 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:10:04,060 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:10:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:04,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-09-25 00:10:04,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:04,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-09-25 00:10:04,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-25 00:10:04,474 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-25 00:10:04,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-09-25 00:10:04,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2024-09-25 00:10:04,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2024-09-25 00:10:04,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-09-25 00:10:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:10:04,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 00:10:08,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387787497] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:08,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-25 00:10:08,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19] total 25 [2024-09-25 00:10:08,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678439501] [2024-09-25 00:10:08,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-25 00:10:08,960 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-25 00:10:08,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 00:10:08,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-25 00:10:08,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=785, Unknown=1, NotChecked=0, Total=870 [2024-09-25 00:10:08,961 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 25 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 6 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-09-25 00:10:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 00:10:10,101 INFO L93 Difference]: Finished difference Result 137 states and 184 transitions. [2024-09-25 00:10:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-25 00:10:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 6 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 58 [2024-09-25 00:10:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 00:10:10,104 INFO L225 Difference]: With dead ends: 137 [2024-09-25 00:10:10,104 INFO L226 Difference]: Without dead ends: 94 [2024-09-25 00:10:10,105 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=219, Invalid=2036, Unknown=1, NotChecked=0, Total=2256 [2024-09-25 00:10:10,106 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 85 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-25 00:10:10,107 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 477 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-25 00:10:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-25 00:10:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2024-09-25 00:10:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 55 states have internal predecessors, (59), 22 states have call successors, (22), 11 states have call predecessors, (22), 11 states have return successors, (28), 19 states have call predecessors, (28), 19 states have call successors, (28) [2024-09-25 00:10:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2024-09-25 00:10:10,139 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 58 [2024-09-25 00:10:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 00:10:10,139 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2024-09-25 00:10:10,140 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 6 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2024-09-25 00:10:10,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2024-09-25 00:10:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-09-25 00:10:10,144 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 00:10:10,144 INFO L216 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 00:10:10,163 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-25 00:10:10,348 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:10,349 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 00:10:10,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 00:10:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -111612641, now seen corresponding path program 1 times [2024-09-25 00:10:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 00:10:10,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893106019] [2024-09-25 00:10:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 00:10:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:12,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 00:10:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:12,531 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 00:10:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:12,533 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-25 00:10:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:12,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-09-25 00:10:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:12,770 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-25 00:10:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:12,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-25 00:10:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:12,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 00:10:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:13,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 00:10:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:13,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-09-25 00:10:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:13,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 00:10:13,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 00:10:13,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893106019] [2024-09-25 00:10:13,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893106019] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 00:10:13,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012337644] [2024-09-25 00:10:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 00:10:13,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 00:10:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 00:10:13,439 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:10:13,440 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:10:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 00:10:13,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-09-25 00:10:13,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 00:10:13,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-09-25 00:10:13,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-25 00:10:14,049 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-25 00:10:14,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-09-25 00:10:14,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-25 00:10:14,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-09-25 00:10:14,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 [2024-09-25 00:10:14,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-09-25 00:10:14,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 24 treesize of output 28 [2024-09-25 00:10:14,639 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_upsweep_~right_14 Int) (v_upsweep_~a.offset_14 Int)) (and (<= |c_upsweep_#in~a.offset| v_upsweep_~a.offset_14) (<= |c_upsweep_#in~right| v_upsweep_~right_14) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_upsweep_#in~a.base| (let ((.cse0 (+ v_upsweep_~a.offset_14 (* v_upsweep_~right_14 4)))) (store (select |c_old(#memory_int#1)| |c_upsweep_#in~a.base|) .cse0 (select (select |c_#memory_int#1| |c_upsweep_#in~a.base|) .cse0))))))) is different from true [2024-09-25 00:10:14,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2024-09-25 00:10:14,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2024-09-25 00:10:15,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2024-09-25 00:10:58,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:10:58,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 228 treesize of output 304 [2024-09-25 00:10:59,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:10:59,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:11:13,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:13,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:11:16,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:16,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:11:17,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:17,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:11:19,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:19,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:11:21,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:21,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:11:23,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:23,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:11:23,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:11:23,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:13:02,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:13:02,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2024-09-25 00:13:02,652 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2024-09-25 00:13:02,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 32 [2024-09-25 00:13:03,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:13:03,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:13:04,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:13:04,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 [2024-09-25 00:13:05,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:13:05,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:13:05,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:13:05,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:13:05,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:13:05,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 18 [2024-09-25 00:13:07,386 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-25 00:13:07,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 357 treesize of output 545