./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:32:04,384 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:32:04,435 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:32:04,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:32:04,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:32:04,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:32:04,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:32:04,464 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:32:04,465 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:32:04,467 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:32:04,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:32:04,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:32:04,468 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:32:04,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:32:04,470 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:32:04,470 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:32:04,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:32:04,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:32:04,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:32:04,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:32:04,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:32:04,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:32:04,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:32:04,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:32:04,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:32:04,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:32:04,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:32:04,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:32:04,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:32:04,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:32:04,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:32:04,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:32:04,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:32:04,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:32:04,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:32:04,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:32:04,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:32:04,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:32:04,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:32:04,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:32:04,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:32:04,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:32:04,476 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b 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 [2024-09-11 20:32:04,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:32:04,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:32:04,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:32:04,714 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:32:04,714 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:32:04,715 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-09-11 20:32:05,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:32:06,056 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:32:06,056 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2024-09-11 20:32:06,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/c9252b55f/304c4aa983104931be9bdc53834bdc02/FLAGfe594e6c7 [2024-09-11 20:32:06,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/c9252b55f/304c4aa983104931be9bdc53834bdc02 [2024-09-11 20:32:06,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:32:06,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:32:06,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:32:06,476 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:32:06,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:32:06,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548d2eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06, skipping insertion in model container [2024-09-11 20:32:06,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:32:06,602 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-09-11 20:32:06,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:32:06,612 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:32:06,624 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2024-09-11 20:32:06,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:32:06,638 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:32:06,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06 WrapperNode [2024-09-11 20:32:06,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:32:06,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:32:06,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:32:06,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:32:06,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,677 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2024-09-11 20:32:06,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:32:06,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:32:06,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:32:06,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:32:06,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,691 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,710 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 1, 1]. The 4 writes are split as follows [0, 2, 2]. [2024-09-11 20:32:06,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,720 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:32:06,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:32:06,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:32:06,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:32:06,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (1/1) ... [2024-09-11 20:32:06,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:32:06,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:06,751 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-11 20:32:06,760 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-11 20:32:06,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:32:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:32:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:32:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-09-11 20:32:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-11 20:32:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 20:32:06,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 20:32:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-09-11 20:32:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2024-09-11 20:32:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2024-09-11 20:32:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:32:06,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:32:06,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 20:32:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 20:32:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-09-11 20:32:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2024-09-11 20:32:06,795 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2024-09-11 20:32:06,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 20:32:06,865 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:32:06,868 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:32:06,977 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-11 20:32:06,977 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:32:07,003 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:32:07,003 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:32:07,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:32:07 BoogieIcfgContainer [2024-09-11 20:32:07,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:32:07,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:32:07,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:32:07,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:32:07,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:32:06" (1/3) ... [2024-09-11 20:32:07,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e64db99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:32:07, skipping insertion in model container [2024-09-11 20:32:07,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:32:06" (2/3) ... [2024-09-11 20:32:07,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e64db99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:32:07, skipping insertion in model container [2024-09-11 20:32:07,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:32:07" (3/3) ... [2024-09-11 20:32:07,009 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2024-09-11 20:32:07,020 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:32:07,020 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 20:32:07,061 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:32:07,066 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;@3aa82a67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:32:07,067 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 20:32:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:32:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-11 20:32:07,076 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:07,076 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:07,077 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:07,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:07,080 INFO L85 PathProgramCache]: Analyzing trace with hash 855928239, now seen corresponding path program 1 times [2024-09-11 20:32:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961009270] [2024-09-11 20:32:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,405 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:32:07,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:07,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961009270] [2024-09-11 20:32:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961009270] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:32:07,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:32:07,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:32:07,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610952558] [2024-09-11 20:32:07,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:32:07,481 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:32:07,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:07,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:32:07,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:32:07,498 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:32:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:07,610 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2024-09-11 20:32:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:32:07,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-11 20:32:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:07,618 INFO L225 Difference]: With dead ends: 32 [2024-09-11 20:32:07,618 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 20:32:07,621 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:32:07,623 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:07,625 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 20:32:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-09-11 20:32:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-11 20:32:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-11 20:32:07,660 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 10 [2024-09-11 20:32:07,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:07,660 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-11 20:32:07,660 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-11 20:32:07,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-11 20:32:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-11 20:32:07,662 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:07,662 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:07,662 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:32:07,663 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:07,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:07,663 INFO L85 PathProgramCache]: Analyzing trace with hash 255373073, now seen corresponding path program 1 times [2024-09-11 20:32:07,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:07,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900060582] [2024-09-11 20:32:07,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:07,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,875 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,924 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-11 20:32:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:32:07,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:07,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900060582] [2024-09-11 20:32:07,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900060582] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:32:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:32:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 20:32:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656668124] [2024-09-11 20:32:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:32:07,933 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:32:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:32:07,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:32:07,935 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:32:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:08,024 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2024-09-11 20:32:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 20:32:08,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2024-09-11 20:32:08,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:08,025 INFO L225 Difference]: With dead ends: 42 [2024-09-11 20:32:08,026 INFO L226 Difference]: Without dead ends: 23 [2024-09-11 20:32:08,026 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:32:08,028 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:08,029 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 64 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-09-11 20:32:08,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-09-11 20:32:08,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-09-11 20:32:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-09-11 20:32:08,035 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 21 [2024-09-11 20:32:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:08,035 INFO L474 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-09-11 20:32:08,035 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:32:08,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-09-11 20:32:08,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 20:32:08,039 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:08,039 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] [2024-09-11 20:32:08,039 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:32:08,040 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:08,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:08,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1037516303, now seen corresponding path program 1 times [2024-09-11 20:32:08,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:08,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016822466] [2024-09-11 20:32:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,409 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-09-11 20:32:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:32:08,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:08,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016822466] [2024-09-11 20:32:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016822466] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004626256] [2024-09-11 20:32:08,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:08,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:08,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:08,417 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-11 20:32:08,418 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-11 20:32:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:08,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-11 20:32:08,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:08,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:32:08,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:32:09,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004626256] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:09,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-09-11 20:32:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933916343] [2024-09-11 20:32:09,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:09,050 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-11 20:32:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-11 20:32:09,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:32:09,051 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-11 20:32:09,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:09,316 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2024-09-11 20:32:09,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:32:09,316 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) Word has length 26 [2024-09-11 20:32:09,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:09,317 INFO L225 Difference]: With dead ends: 48 [2024-09-11 20:32:09,318 INFO L226 Difference]: Without dead ends: 27 [2024-09-11 20:32:09,318 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=880, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 20:32:09,320 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:09,321 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 111 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:09,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-09-11 20:32:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-09-11 20:32:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-09-11 20:32:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-09-11 20:32:09,331 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 26 [2024-09-11 20:32:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:09,332 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-09-11 20:32:09,332 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-11 20:32:09,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-09-11 20:32:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-11 20:32:09,334 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:09,334 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:09,348 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:32:09,538 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-11 20:32:09,539 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:09,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1013053495, now seen corresponding path program 2 times [2024-09-11 20:32:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:09,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455241000] [2024-09-11 20:32:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,892 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,894 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 20:32:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:09,975 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:10,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:10,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:10,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-11 20:32:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-11 20:32:10,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:10,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455241000] [2024-09-11 20:32:10,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455241000] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:10,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587013403] [2024-09-11 20:32:10,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:32:10,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:10,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:10,117 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-11 20:32:10,118 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-11 20:32:10,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:32:10,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:10,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-11 20:32:10,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:10,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 20:32:10,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-11 20:32:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587013403] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:11,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:11,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 14] total 25 [2024-09-11 20:32:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130152331] [2024-09-11 20:32:11,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:11,229 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-11 20:32:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-11 20:32:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2024-09-11 20:32:11,230 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 8 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-11 20:32:11,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:11,361 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-09-11 20:32:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:32:11,361 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 8 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) Word has length 52 [2024-09-11 20:32:11,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:11,362 INFO L225 Difference]: With dead ends: 54 [2024-09-11 20:32:11,362 INFO L226 Difference]: Without dead ends: 29 [2024-09-11 20:32:11,362 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=626, Unknown=0, NotChecked=0, Total=812 [2024-09-11 20:32:11,363 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:11,363 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 106 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-11 20:32:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-11 20:32:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-09-11 20:32:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-09-11 20:32:11,368 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 52 [2024-09-11 20:32:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:11,368 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-09-11 20:32:11,368 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 8 states have call successors, (17), 7 states have call predecessors, (17), 8 states have return successors, (15), 6 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-11 20:32:11,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-09-11 20:32:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-11 20:32:11,369 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:11,370 INFO L216 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:11,384 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-11 20:32:11,573 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-11 20:32:11,574 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:11,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:11,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1464884653, now seen corresponding path program 3 times [2024-09-11 20:32:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:11,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833605998] [2024-09-11 20:32:11,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:11,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:11,965 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:12,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,199 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:32:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,206 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,212 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,214 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,233 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-11 20:32:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 8 proven. 75 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-09-11 20:32:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833605998] [2024-09-11 20:32:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833605998] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43414370] [2024-09-11 20:32:12,235 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:32:12,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:12,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:12,237 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-11 20:32:12,238 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-11 20:32:12,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 20:32:12,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:12,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-09-11 20:32:12,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:12,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-09-11 20:32:12,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:13,145 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-09-11 20:32:13,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43414370] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:13,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:13,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 14] total 34 [2024-09-11 20:32:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080577821] [2024-09-11 20:32:13,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:13,146 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-11 20:32:13,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:13,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-11 20:32:13,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2024-09-11 20:32:13,149 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 34 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 13 states have call successors, (17), 7 states have call predecessors, (17), 12 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-11 20:32:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:13,454 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2024-09-11 20:32:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-11 20:32:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 13 states have call successors, (17), 7 states have call predecessors, (17), 12 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) Word has length 62 [2024-09-11 20:32:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:13,455 INFO L225 Difference]: With dead ends: 60 [2024-09-11 20:32:13,455 INFO L226 Difference]: Without dead ends: 33 [2024-09-11 20:32:13,456 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2024-09-11 20:32:13,457 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:13,457 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 125 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-11 20:32:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-11 20:32:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2024-09-11 20:32:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-11 20:32:13,462 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 62 [2024-09-11 20:32:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:13,462 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-11 20:32:13,463 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 28 states have internal predecessors, (49), 13 states have call successors, (17), 7 states have call predecessors, (17), 12 states have return successors, (18), 12 states have call predecessors, (18), 13 states have call successors, (18) [2024-09-11 20:32:13,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-11 20:32:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-09-11 20:32:13,465 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:13,465 INFO L216 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:13,477 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-11 20:32:13,665 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-11 20:32:13,666 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:13,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:13,666 INFO L85 PathProgramCache]: Analyzing trace with hash -365015879, now seen corresponding path program 4 times [2024-09-11 20:32:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043703517] [2024-09-11 20:32:13,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:13,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,017 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,544 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 20:32:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,613 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,617 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 20:32:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,651 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,661 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,664 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-09-11 20:32:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 6 proven. 212 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-09-11 20:32:14,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:14,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043703517] [2024-09-11 20:32:14,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043703517] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:14,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367108697] [2024-09-11 20:32:14,673 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:32:14,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:14,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:14,675 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-11 20:32:14,676 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-11 20:32:14,779 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:32:14,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:14,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-09-11 20:32:14,787 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:14,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 363 proven. 24 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-09-11 20:32:14,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 127 proven. 165 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-09-11 20:32:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367108697] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:16,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:16,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 22] total 35 [2024-09-11 20:32:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085652099] [2024-09-11 20:32:16,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:16,680 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-11 20:32:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-11 20:32:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 20:32:16,682 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 35 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 10 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-09-11 20:32:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:16,869 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2024-09-11 20:32:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:32:16,869 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 10 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) Word has length 103 [2024-09-11 20:32:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:16,870 INFO L225 Difference]: With dead ends: 66 [2024-09-11 20:32:16,870 INFO L226 Difference]: Without dead ends: 35 [2024-09-11 20:32:16,871 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 217 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=331, Invalid=1151, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 20:32:16,872 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:16,872 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 160 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:16,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-11 20:32:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-09-11 20:32:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2024-09-11 20:32:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-09-11 20:32:16,879 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 103 [2024-09-11 20:32:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:16,879 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-09-11 20:32:16,879 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 27 states have (on average 2.0) internal successors, (54), 28 states have internal predecessors, (54), 10 states have call successors, (21), 9 states have call predecessors, (21), 12 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-09-11 20:32:16,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-09-11 20:32:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-09-11 20:32:16,880 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:16,880 INFO L216 NwaCegarLoop]: trace histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:16,893 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-11 20:32:17,081 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:17,081 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:17,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash 620375637, now seen corresponding path program 5 times [2024-09-11 20:32:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400969961] [2024-09-11 20:32:17,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:17,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:17,522 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:17,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:17,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,209 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,245 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,269 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 20:32:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,296 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,305 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,308 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,311 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,313 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 20:32:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,319 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,326 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,333 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,337 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,339 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-09-11 20:32:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 307 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2024-09-11 20:32:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400969961] [2024-09-11 20:32:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400969961] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116615960] [2024-09-11 20:32:18,344 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 20:32:18,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:18,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:18,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:18,347 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:32:18,526 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-09-11 20:32:18,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:18,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-09-11 20:32:18,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:18,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-09-11 20:32:18,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-09-11 20:32:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116615960] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:20,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 26] total 39 [2024-09-11 20:32:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829562166] [2024-09-11 20:32:20,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:20,807 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-11 20:32:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:20,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-11 20:32:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1170, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 20:32:20,808 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 39 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (25), 12 states have call predecessors, (25), 10 states have call successors, (25) [2024-09-11 20:32:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:20,961 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2024-09-11 20:32:20,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:32:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (25), 12 states have call predecessors, (25), 10 states have call successors, (25) Word has length 118 [2024-09-11 20:32:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:20,964 INFO L225 Difference]: With dead ends: 70 [2024-09-11 20:32:20,964 INFO L226 Difference]: Without dead ends: 37 [2024-09-11 20:32:20,964 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 249 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2024-09-11 20:32:20,965 INFO L434 NwaCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:20,965 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 158 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-11 20:32:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-11 20:32:20,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-09-11 20:32:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2024-09-11 20:32:20,977 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 118 [2024-09-11 20:32:20,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:20,978 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2024-09-11 20:32:20,979 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 10 states have call successors, (22), 10 states have call predecessors, (22), 14 states have return successors, (25), 12 states have call predecessors, (25), 10 states have call successors, (25) [2024-09-11 20:32:20,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:20,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2024-09-11 20:32:20,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-09-11 20:32:20,981 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:20,981 INFO L216 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:20,995 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 20:32:21,182 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:32:21,182 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:21,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:21,182 INFO L85 PathProgramCache]: Analyzing trace with hash -149039543, now seen corresponding path program 6 times [2024-09-11 20:32:21,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:21,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624417736] [2024-09-11 20:32:21,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:21,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:21,566 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:21,974 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:21,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:21,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:21,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:21,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:21,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,221 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,242 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,246 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,359 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,370 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,380 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1009 trivial. 0 not checked. [2024-09-11 20:32:22,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:22,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624417736] [2024-09-11 20:32:22,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624417736] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:22,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346267386] [2024-09-11 20:32:22,406 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 20:32:22,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:22,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:22,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:22,408 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 20:32:22,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-09-11 20:32:22,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:22,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-09-11 20:32:22,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:22,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-09-11 20:32:22,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-09-11 20:32:23,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346267386] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:23,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 18] total 37 [2024-09-11 20:32:23,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187525989] [2024-09-11 20:32:23,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:23,796 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-11 20:32:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:23,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-11 20:32:23,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1062, Unknown=0, NotChecked=0, Total=1332 [2024-09-11 20:32:23,797 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 37 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (17), 16 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-11 20:32:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:23,961 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-11 20:32:23,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 20:32:23,961 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (17), 16 states have call predecessors, (17), 13 states have call successors, (17) Word has length 133 [2024-09-11 20:32:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:23,962 INFO L225 Difference]: With dead ends: 45 [2024-09-11 20:32:23,962 INFO L226 Difference]: Without dead ends: 40 [2024-09-11 20:32:23,963 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2024-09-11 20:32:23,963 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:23,963 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 88 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-09-11 20:32:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-09-11 20:32:23,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 24 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2024-09-11 20:32:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2024-09-11 20:32:23,971 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 133 [2024-09-11 20:32:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:23,972 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2024-09-11 20:32:23,972 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 30 states have internal predecessors, (47), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (17), 16 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-11 20:32:23,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2024-09-11 20:32:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-09-11 20:32:23,973 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:23,973 INFO L216 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:23,987 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-11 20:32:24,174 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:24,174 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:24,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:24,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1739371329, now seen corresponding path program 7 times [2024-09-11 20:32:24,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:24,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162409107] [2024-09-11 20:32:24,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:24,771 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,337 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,347 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,352 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,362 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,736 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,752 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,960 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,972 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,977 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,985 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,988 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,990 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:25,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:25,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:25,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,167 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 1802 trivial. 0 not checked. [2024-09-11 20:32:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162409107] [2024-09-11 20:32:26,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162409107] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:26,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96646321] [2024-09-11 20:32:26,196 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-11 20:32:26,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:26,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:26,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:26,201 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 20:32:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:26,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-09-11 20:32:26,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:26,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-09-11 20:32:26,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2024-09-11 20:32:28,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96646321] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:28,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:28,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 22] total 49 [2024-09-11 20:32:28,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427002395] [2024-09-11 20:32:28,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:28,081 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-09-11 20:32:28,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:28,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-09-11 20:32:28,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=1919, Unknown=0, NotChecked=0, Total=2352 [2024-09-11 20:32:28,082 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 49 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 41 states have internal predecessors, (59), 19 states have call successors, (21), 9 states have call predecessors, (21), 16 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2024-09-11 20:32:28,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:28,395 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2024-09-11 20:32:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:32:28,395 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 41 states have internal predecessors, (59), 19 states have call successors, (21), 9 states have call predecessors, (21), 16 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) Word has length 174 [2024-09-11 20:32:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:28,397 INFO L225 Difference]: With dead ends: 51 [2024-09-11 20:32:28,398 INFO L226 Difference]: Without dead ends: 46 [2024-09-11 20:32:28,398 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=621, Invalid=2571, Unknown=0, NotChecked=0, Total=3192 [2024-09-11 20:32:28,399 INFO L434 NwaCegarLoop]: 6 mSDtfsCounter, 41 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:28,399 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 63 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:32:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-11 20:32:28,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-09-11 20:32:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (17), 15 states have call predecessors, (17), 4 states have call successors, (17) [2024-09-11 20:32:28,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-09-11 20:32:28,405 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 174 [2024-09-11 20:32:28,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:28,406 INFO L474 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-09-11 20:32:28,406 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 41 states have internal predecessors, (59), 19 states have call successors, (21), 9 states have call predecessors, (21), 16 states have return successors, (23), 22 states have call predecessors, (23), 19 states have call successors, (23) [2024-09-11 20:32:28,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:28,406 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-09-11 20:32:28,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-09-11 20:32:28,407 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:28,407 INFO L216 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:28,420 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:32:28,611 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:28,612 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:28,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:28,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1394733523, now seen corresponding path program 1 times [2024-09-11 20:32:28,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159555114] [2024-09-11 20:32:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:28,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:28,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:29,372 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,172 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,176 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,700 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,707 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,711 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,714 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,716 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:30,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,044 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,052 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,057 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,061 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,068 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,252 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,258 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,260 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,261 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,262 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,341 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,350 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,358 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,365 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,366 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-09-11 20:32:31,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:31,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159555114] [2024-09-11 20:32:31,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159555114] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:31,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931671192] [2024-09-11 20:32:31,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:31,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:31,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:31,397 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:31,398 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 20:32:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:31,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 80 conjuncts are in the unsatisfiable core [2024-09-11 20:32:31,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:31,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-11 20:32:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-09-11 20:32:31,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:33,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2024-09-11 20:32:33,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931671192] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:32:33,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:32:33,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 26] total 46 [2024-09-11 20:32:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352703128] [2024-09-11 20:32:33,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:33,891 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-09-11 20:32:33,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:33,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-09-11 20:32:33,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=1676, Unknown=0, NotChecked=0, Total=2070 [2024-09-11 20:32:33,893 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-09-11 20:32:34,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:34,110 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-09-11 20:32:34,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:32:34,110 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) Word has length 215 [2024-09-11 20:32:34,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:34,111 INFO L225 Difference]: With dead ends: 48 [2024-09-11 20:32:34,113 INFO L226 Difference]: Without dead ends: 43 [2024-09-11 20:32:34,113 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 478 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=577, Invalid=2179, Unknown=0, NotChecked=0, Total=2756 [2024-09-11 20:32:34,114 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:34,115 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 130 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:32:34,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-09-11 20:32:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-09-11 20:32:34,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2024-09-11 20:32:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-09-11 20:32:34,120 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 215 [2024-09-11 20:32:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:34,121 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-09-11 20:32:34,121 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 18 states have call successors, (21), 10 states have call predecessors, (21), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-09-11 20:32:34,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-09-11 20:32:34,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-09-11 20:32:34,122 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:34,123 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:34,137 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-11 20:32:34,323 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:34,323 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:34,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:34,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1043833273, now seen corresponding path program 8 times [2024-09-11 20:32:34,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:34,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871179692] [2024-09-11 20:32:34,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:34,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,060 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,633 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,637 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,640 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,644 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,646 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:35,647 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,475 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,483 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,485 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,487 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,489 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,852 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,860 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:36,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,158 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,171 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,360 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,382 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,541 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,710 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 937 proven. 34 refuted. 0 times theorem prover too weak. 3232 trivial. 0 not checked. [2024-09-11 20:32:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871179692] [2024-09-11 20:32:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871179692] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601902137] [2024-09-11 20:32:37,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:32:37,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:37,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:37,760 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:37,761 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:32:38,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:32:38,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:38,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 144 conjuncts are in the unsatisfiable core [2024-09-11 20:32:38,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:38,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-09-11 20:32:38,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-09-11 20:32:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1171 proven. 81 refuted. 0 times theorem prover too weak. 2951 trivial. 0 not checked. [2024-09-11 20:32:38,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:39,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-11 20:32:39,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-11 20:32:39,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-11 20:32:39,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-11 20:32:40,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-09-11 20:32:40,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601902137] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:40,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:32:40,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 23 [2024-09-11 20:32:40,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371455907] [2024-09-11 20:32:40,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:40,762 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 20:32:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:40,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 20:32:40,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2024-09-11 20:32:40,763 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 23 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 8 states have call successors, (15), 3 states have call predecessors, (15), 11 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-11 20:32:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:41,139 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2024-09-11 20:32:41,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-11 20:32:41,139 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 8 states have call successors, (15), 3 states have call predecessors, (15), 11 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) Word has length 256 [2024-09-11 20:32:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:41,140 INFO L225 Difference]: With dead ends: 48 [2024-09-11 20:32:41,140 INFO L226 Difference]: Without dead ends: 45 [2024-09-11 20:32:41,141 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1375, Unknown=0, NotChecked=0, Total=1560 [2024-09-11 20:32:41,141 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:41,141 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 204 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:32:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-11 20:32:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-09-11 20:32:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 4 states have call successors, (4), 2 states have call predecessors, (4), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2024-09-11 20:32:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-09-11 20:32:41,148 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 256 [2024-09-11 20:32:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:41,149 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-09-11 20:32:41,149 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.05) internal successors, (41), 22 states have internal predecessors, (41), 8 states have call successors, (15), 3 states have call predecessors, (15), 11 states have return successors, (15), 11 states have call predecessors, (15), 8 states have call successors, (15) [2024-09-11 20:32:41,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2024-09-11 20:32:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-09-11 20:32:41,150 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:32:41,150 INFO L216 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:32:41,163 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-11 20:32:41,350 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-09-11 20:32:41,350 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:32:41,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:41,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1043831351, now seen corresponding path program 2 times [2024-09-11 20:32:41,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:32:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977831433] [2024-09-11 20:32:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:32:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:32:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:41,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 20:32:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,222 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,228 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,559 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,565 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,572 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,577 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,800 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,811 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,814 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,818 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,979 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,987 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,994 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:42,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,000 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,098 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,105 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,117 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,225 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,235 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,240 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,244 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-09-11 20:32:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,254 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-11 20:32:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:32:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 4165 trivial. 0 not checked. [2024-09-11 20:32:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:32:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977831433] [2024-09-11 20:32:43,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977831433] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:43,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271442769] [2024-09-11 20:32:43,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:32:43,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:32:43,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:32:43,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:32:43,301 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:32:43,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:32:43,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:32:43,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-09-11 20:32:43,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:32:43,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-09-11 20:32:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 1186 proven. 18 refuted. 0 times theorem prover too weak. 2999 trivial. 0 not checked. [2024-09-11 20:32:43,836 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:32:44,679 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:44,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-09-11 20:32:44,984 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:44,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-09-11 20:32:45,223 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:45,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-09-11 20:32:45,392 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:45,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-09-11 20:32:45,525 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-09-11 20:32:45,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2024-09-11 20:32:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271442769] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:32:46,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:32:46,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2024-09-11 20:32:46,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591913919] [2024-09-11 20:32:46,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:32:46,463 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 20:32:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:32:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 20:32:46,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=434, Unknown=1, NotChecked=0, Total=506 [2024-09-11 20:32:46,464 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-11 20:32:50,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-11 20:32:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:32:50,684 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-09-11 20:32:50,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:32:50,685 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 256 [2024-09-11 20:32:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:32:50,686 INFO L225 Difference]: With dead ends: 47 [2024-09-11 20:32:50,686 INFO L226 Difference]: Without dead ends: 0 [2024-09-11 20:32:50,686 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=773, Unknown=1, NotChecked=0, Total=930 [2024-09-11 20:32:50,687 INFO L434 NwaCegarLoop]: 5 mSDtfsCounter, 32 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:32:50,687 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 26 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 3 Unknown, 0 Unchecked, 4.1s Time] [2024-09-11 20:32:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-09-11 20:32:50,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-09-11 20:32:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:32:50,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-09-11 20:32:50,687 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2024-09-11 20:32:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:32:50,687 INFO L474 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-09-11 20:32:50,687 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 14 states have internal predecessors, (30), 5 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2024-09-11 20:32:50,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:32:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-09-11 20:32:50,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-09-11 20:32:50,691 INFO L785 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-09-11 20:32:50,706 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-11 20:32:50,892 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-11 20:32:50,894 INFO L408 BasicCegarLoop]: Path program histogram: [8, 2, 1, 1] [2024-09-11 20:32:50,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-09-11 20:32:52,617 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-11 20:32:52,628 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 20:32:52,629 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-11 20:32:52,630 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-11 20:32:52,630 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-11 20:32:52,630 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:32:52,630 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-11 20:32:52,631 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 20:32:52,632 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-11 20:32:52,632 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-09-11 20:32:52,632 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-09-11 20:32:52,634 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-11 20:32:52,635 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-11 20:32:52,635 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] [2024-09-11 20:32:52,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-09-11 20:32:52,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-09-11 20:32:52,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-09-11 20:32:52,636 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-09-11 20:32:52,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.09 08:32:52 BoogieIcfgContainer [2024-09-11 20:32:52,636 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-11 20:32:52,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-09-11 20:32:52,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-09-11 20:32:52,638 INFO L274 PluginConnector]: Witness Printer initialized [2024-09-11 20:32:52,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:32:07" (3/4) ... [2024-09-11 20:32:52,640 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-09-11 20:32:52,644 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2024-09-11 20:32:52,644 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2024-09-11 20:32:52,648 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-09-11 20:32:52,648 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-09-11 20:32:52,648 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-09-11 20:32:52,648 INFO L896 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-09-11 20:32:52,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.graphml [2024-09-11 20:32:52,724 INFO L149 WitnessManager]: Wrote witness to /storage/repos/certificate-witnesses-artifact/automizer/witness.yml [2024-09-11 20:32:52,724 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-09-11 20:32:52,724 INFO L158 Benchmark]: Toolchain (without parser) took 46250.34ms. Allocated memory was 153.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 99.9MB in the beginning and 557.3MB in the end (delta: -457.4MB). Peak memory consumption was 792.3MB. Max. memory is 16.1GB. [2024-09-11 20:32:52,725 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-11 20:32:52,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.83ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 89.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-11 20:32:52,725 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.62ms. Allocated memory is still 153.1MB. Free memory was 88.6MB in the beginning and 87.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:32:52,725 INFO L158 Benchmark]: Boogie Preprocessor took 43.34ms. Allocated memory is still 153.1MB. Free memory was 87.3MB in the beginning and 85.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-11 20:32:52,725 INFO L158 Benchmark]: RCFGBuilder took 281.95ms. Allocated memory is still 153.1MB. Free memory was 85.2MB in the beginning and 118.1MB in the end (delta: -32.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-11 20:32:52,725 INFO L158 Benchmark]: TraceAbstraction took 45631.26ms. Allocated memory was 153.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 117.2MB in the beginning and 562.5MB in the end (delta: -445.3MB). Peak memory consumption was 806.3MB. Max. memory is 16.1GB. [2024-09-11 20:32:52,726 INFO L158 Benchmark]: Witness Printer took 86.65ms. Allocated memory is still 1.4GB. Free memory was 562.5MB in the beginning and 557.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-09-11 20:32:52,727 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 57.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.83ms. Allocated memory is still 153.1MB. Free memory was 99.9MB in the beginning and 89.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.62ms. Allocated memory is still 153.1MB. Free memory was 88.6MB in the beginning and 87.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.34ms. Allocated memory is still 153.1MB. Free memory was 87.3MB in the beginning and 85.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 281.95ms. Allocated memory is still 153.1MB. Free memory was 85.2MB in the beginning and 118.1MB in the end (delta: -32.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 45631.26ms. Allocated memory was 153.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 117.2MB in the beginning and 562.5MB in the end (delta: -445.3MB). Peak memory consumption was 806.3MB. Max. memory is 16.1GB. * Witness Printer took 86.65ms. Allocated memory is still 1.4GB. Free memory was 562.5MB in the beginning and 557.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#1,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.8s, OverallIterations: 12, TraceHistogramMax: 42, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 250 mSDsluCounter, 1283 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1140 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2340 IncrementalHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 143 mSDtfsCounter, 2340 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3070 GetRequests, 2646 SyntacticMatches, 22 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5592 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=9, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 6 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 32.9s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2729 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3674 ConstructedInterpolants, 34 QuantifiedInterpolants, 13922 SizeOfPredicates, 132 NumberOfNonLiveVariables, 5536 ConjunctsInSsa, 687 ConjunctsInUnsatCore, 30 InterpolantComputations, 2 PerfectInterpolantSequences, 36871/38647 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 67]: Location Invariant Derived location invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-09-11 20:32:52,751 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE