./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/verifythis/prefixsum_iter.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/verifythis/prefixsum_iter.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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --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 19:37:26,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 19:37:26,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 19:37:26,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 19:37:26,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 19:37:26,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 19:37:26,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 19:37:26,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 19:37:26,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 19:37:26,518 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 19:37:26,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 19:37:26,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 19:37:26,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 19:37:26,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 19:37:26,520 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 19:37:26,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 19:37:26,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 19:37:26,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 19:37:26,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 19:37:26,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 19:37:26,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 19:37:26,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 19:37:26,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 19:37:26,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 19:37:26,524 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 19:37:26,524 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 19:37:26,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 19:37:26,525 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 19:37:26,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 19:37:26,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 19:37:26,526 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 19:37:26,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 19:37:26,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:37:26,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 19:37:26,527 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 19:37:26,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 19:37:26,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 19:37:26,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 19:37:26,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 19:37:26,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 19:37:26,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 19:37:26,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 19:37:26,530 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d 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 19:37:26,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 19:37:26,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 19:37:26,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 19:37:26,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 19:37:26,822 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 19:37:26,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-09-11 19:37:28,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 19:37:28,372 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 19:37:28,374 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-09-11 19:37:28,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8fed49cab/a12f90ac237b45b59be673323218b148/FLAG824a49b41 [2024-09-11 19:37:28,738 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8fed49cab/a12f90ac237b45b59be673323218b148 [2024-09-11 19:37:28,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 19:37:28,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 19:37:28,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 19:37:28,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 19:37:28,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 19:37:28,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:37:28" (1/1) ... [2024-09-11 19:37:28,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9738018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:28, skipping insertion in model container [2024-09-11 19:37:28,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 07:37:28" (1/1) ... [2024-09-11 19:37:28,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 19:37:28,914 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/verifythis/prefixsum_iter.c[526,539] [2024-09-11 19:37:28,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:37:28,954 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 19:37:28,964 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/verifythis/prefixsum_iter.c[526,539] [2024-09-11 19:37:28,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 19:37:28,999 INFO L204 MainTranslator]: Completed translation [2024-09-11 19:37:29,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29 WrapperNode [2024-09-11 19:37:29,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 19:37:29,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 19:37:29,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 19:37:29,002 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 19:37:29,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,054 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 130 [2024-09-11 19:37:29,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 19:37:29,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 19:37:29,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 19:37:29,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 19:37:29,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,084 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-09-11 19:37:29,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,097 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 19:37:29,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 19:37:29,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 19:37:29,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 19:37:29,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (1/1) ... [2024-09-11 19:37:29,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 19:37:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:29,140 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 19:37:29,144 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 19:37:29,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 19:37:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-11 19:37:29,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-11 19:37:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 19:37:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 19:37:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-11 19:37:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-11 19:37:29,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-09-11 19:37:29,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 19:37:29,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 19:37:29,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-11 19:37:29,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-11 19:37:29,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-09-11 19:37:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-09-11 19:37:29,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-11 19:37:29,313 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 19:37:29,315 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 19:37:29,590 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-09-11 19:37:29,591 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 19:37:29,637 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 19:37:29,637 INFO L318 CfgBuilder]: Removed 7 assume(true) statements. [2024-09-11 19:37:29,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:37:29 BoogieIcfgContainer [2024-09-11 19:37:29,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 19:37:29,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 19:37:29,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 19:37:29,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 19:37:29,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 07:37:28" (1/3) ... [2024-09-11 19:37:29,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed675c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:37:29, skipping insertion in model container [2024-09-11 19:37:29,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 07:37:29" (2/3) ... [2024-09-11 19:37:29,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed675c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 07:37:29, skipping insertion in model container [2024-09-11 19:37:29,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 07:37:29" (3/3) ... [2024-09-11 19:37:29,647 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2024-09-11 19:37:29,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 19:37:29,674 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-11 19:37:29,732 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 19:37:29,738 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;@53d4f58e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 19:37:29,738 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-11 19:37:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 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 19:37:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-11 19:37:29,750 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:29,750 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:29,751 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:29,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:29,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1767624777, now seen corresponding path program 1 times [2024-09-11 19:37:29,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:29,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312721317] [2024-09-11 19:37:29,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:29,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:29,966 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:29,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:29,991 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:29,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:30,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312721317] [2024-09-11 19:37:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312721317] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-11 19:37:30,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578321509] [2024-09-11 19:37:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:30,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-11 19:37:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:30,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-11 19:37:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:37:30,057 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 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 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:37:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:30,144 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2024-09-11 19:37:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-11 19:37:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-09-11 19:37:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:30,155 INFO L225 Difference]: With dead ends: 66 [2024-09-11 19:37:30,155 INFO L226 Difference]: Without dead ends: 32 [2024-09-11 19:37:30,158 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-11 19:37:30,162 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:30,163 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-11 19:37:30,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-09-11 19:37:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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 19:37:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-09-11 19:37:30,206 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 32 [2024-09-11 19:37:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:30,207 INFO L474 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-09-11 19:37:30,207 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-11 19:37:30,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-09-11 19:37:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-11 19:37:30,210 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:30,210 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:30,211 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 19:37:30,212 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:30,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1681595422, now seen corresponding path program 1 times [2024-09-11 19:37:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:30,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622167983] [2024-09-11 19:37:30,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:30,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:30,655 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:30,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:30,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:30,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:30,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622167983] [2024-09-11 19:37:30,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622167983] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:30,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 19:37:30,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 19:37:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216710276] [2024-09-11 19:37:30,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:30,686 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 19:37:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 19:37:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:37:30,689 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:30,821 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2024-09-11 19:37:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:37:30,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-09-11 19:37:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:30,823 INFO L225 Difference]: With dead ends: 50 [2024-09-11 19:37:30,823 INFO L226 Difference]: Without dead ends: 35 [2024-09-11 19:37:30,823 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:37:30,825 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:30,825 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:30,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-09-11 19:37:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-09-11 19:37:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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 19:37:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-09-11 19:37:30,839 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 32 [2024-09-11 19:37:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:30,841 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-09-11 19:37:30,841 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:30,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-09-11 19:37:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-11 19:37:30,844 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:30,844 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:30,844 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 19:37:30,845 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:30,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1002806207, now seen corresponding path program 1 times [2024-09-11 19:37:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27486146] [2024-09-11 19:37:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:30,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:31,342 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:31,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:31,361 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:31,396 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27486146] [2024-09-11 19:37:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27486146] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:31,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146915416] [2024-09-11 19:37:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:31,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:31,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:31,428 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 19:37:31,430 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 19:37:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:31,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 19:37:31,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:31,686 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 19:37:31,785 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:31,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:31,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-09-11 19:37:31,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 12 [2024-09-11 19:37:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:31,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146915416] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:31,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:31,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-09-11 19:37:31,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87182687] [2024-09-11 19:37:31,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:31,909 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 19:37:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:31,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 19:37:31,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-09-11 19:37:31,911 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 18 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 19:37:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:32,264 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-09-11 19:37:32,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-11 19:37:32,264 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2024-09-11 19:37:32,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:32,266 INFO L225 Difference]: With dead ends: 48 [2024-09-11 19:37:32,267 INFO L226 Difference]: Without dead ends: 46 [2024-09-11 19:37:32,267 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2024-09-11 19:37:32,268 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:32,270 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 195 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:37:32,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-09-11 19:37:32,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2024-09-11 19:37:32,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 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 19:37:32,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-09-11 19:37:32,285 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 33 [2024-09-11 19:37:32,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:32,285 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-09-11 19:37:32,286 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-09-11 19:37:32,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,286 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-09-11 19:37:32,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 19:37:32,287 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:32,287 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:32,306 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 19:37:32,492 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 19:37:32,493 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:32,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1197667175, now seen corresponding path program 1 times [2024-09-11 19:37:32,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:32,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562767425] [2024-09-11 19:37:32,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,748 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,750 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:32,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:32,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562767425] [2024-09-11 19:37:32,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562767425] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:32,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076391965] [2024-09-11 19:37:32,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:32,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:32,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:32,757 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 19:37:32,758 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 19:37:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:32,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:37:32,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:32,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:32,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 19:37:33,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076391965] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:33,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2024-09-11 19:37:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168360610] [2024-09-11 19:37:33,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:33,025 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 19:37:33,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 19:37:33,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:37:33,028 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:33,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:33,144 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2024-09-11 19:37:33,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 19:37:33,145 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-09-11 19:37:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:33,146 INFO L225 Difference]: With dead ends: 56 [2024-09-11 19:37:33,148 INFO L226 Difference]: Without dead ends: 38 [2024-09-11 19:37:33,148 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:37:33,149 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:33,150 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 158 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-09-11 19:37:33,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-09-11 19:37:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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 19:37:33,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-09-11 19:37:33,163 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 36 [2024-09-11 19:37:33,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:33,164 INFO L474 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-09-11 19:37:33,164 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:33,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-09-11 19:37:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-11 19:37:33,166 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:33,166 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:33,184 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 19:37:33,366 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 19:37:33,367 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:33,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1045638214, now seen corresponding path program 2 times [2024-09-11 19:37:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:33,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500293197] [2024-09-11 19:37:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:33,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,554 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,570 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:33,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:37:33,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:33,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500293197] [2024-09-11 19:37:33,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500293197] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:33,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267246612] [2024-09-11 19:37:33,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:37:33,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:33,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:33,575 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 19:37:33,577 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 19:37:33,665 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:37:33,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:37:33,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:37:33,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 19:37:33,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:37:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267246612] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:33,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:37:33,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-09-11 19:37:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400918754] [2024-09-11 19:37:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:33,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 19:37:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:33,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 19:37:33,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:37:33,752 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:33,830 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-09-11 19:37:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-11 19:37:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-09-11 19:37:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:33,832 INFO L225 Difference]: With dead ends: 53 [2024-09-11 19:37:33,832 INFO L226 Difference]: Without dead ends: 39 [2024-09-11 19:37:33,832 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-09-11 19:37:33,833 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:33,835 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 121 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:33,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-11 19:37:33,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-09-11 19:37:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 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 19:37:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-09-11 19:37:33,846 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 37 [2024-09-11 19:37:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:33,865 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-09-11 19:37:33,865 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:33,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-09-11 19:37:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-11 19:37:33,866 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:33,867 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:33,883 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-11 19:37:34,067 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 19:37:34,068 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:34,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -2052240841, now seen corresponding path program 1 times [2024-09-11 19:37:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854944883] [2024-09-11 19:37:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,227 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:37:34,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:34,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854944883] [2024-09-11 19:37:34,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854944883] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:34,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509660083] [2024-09-11 19:37:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:34,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:34,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:34,235 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 19:37:34,236 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 19:37:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:37:34,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:34,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:37:34,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 19:37:34,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509660083] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:34,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:34,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-09-11 19:37:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700001312] [2024-09-11 19:37:34,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:34,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 19:37:34,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 19:37:34,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-09-11 19:37:34,478 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:34,683 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-09-11 19:37:34,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:37:34,684 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-09-11 19:37:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:34,686 INFO L225 Difference]: With dead ends: 57 [2024-09-11 19:37:34,686 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 19:37:34,686 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-09-11 19:37:34,687 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:34,687 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 194 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:34,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 19:37:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-09-11 19:37:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 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 19:37:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-09-11 19:37:34,700 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2024-09-11 19:37:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:34,701 INFO L474 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-09-11 19:37:34,701 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:34,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-09-11 19:37:34,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-11 19:37:34,702 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:34,702 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:34,719 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 19:37:34,903 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 19:37:34,903 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:34,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash -104890547, now seen corresponding path program 1 times [2024-09-11 19:37:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093416733] [2024-09-11 19:37:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,984 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,986 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,992 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,995 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:37:34,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093416733] [2024-09-11 19:37:34,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093416733] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:34,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949810858] [2024-09-11 19:37:34,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:34,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:34,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:34,999 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 19:37:35,002 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 19:37:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:35,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-11 19:37:35,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:37:35,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-11 19:37:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949810858] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 19:37:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-11 19:37:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-11 19:37:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675659106] [2024-09-11 19:37:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 19:37:35,158 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 19:37:35,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:35,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 19:37:35,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:37:35,159 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:35,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:35,207 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-09-11 19:37:35,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 19:37:35,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-09-11 19:37:35,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:35,208 INFO L225 Difference]: With dead ends: 50 [2024-09-11 19:37:35,208 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 19:37:35,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-11 19:37:35,210 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:35,210 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 19:37:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 19:37:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-09-11 19:37:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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 19:37:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-09-11 19:37:35,225 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 41 [2024-09-11 19:37:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:35,225 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-09-11 19:37:35,226 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:35,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-09-11 19:37:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-11 19:37:35,227 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:35,227 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:35,245 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-11 19:37:35,427 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 19:37:35,428 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:35,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:35,428 INFO L85 PathProgramCache]: Analyzing trace with hash 525282697, now seen corresponding path program 1 times [2024-09-11 19:37:35,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:35,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489333778] [2024-09-11 19:37:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:35,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:35,567 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:35,576 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:35,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:37:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489333778] [2024-09-11 19:37:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489333778] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:35,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567905101] [2024-09-11 19:37:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:35,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:35,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:35,583 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 19:37:35,585 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 19:37:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:35,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-11 19:37:35,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:35,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:37:35,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:37:35,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567905101] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:37:35,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:37:35,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 13 [2024-09-11 19:37:35,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992965967] [2024-09-11 19:37:35,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:37:35,891 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-11 19:37:35,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:37:35,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-11 19:37:35,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-09-11 19:37:35,892 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:37:36,071 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-09-11 19:37:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 19:37:36,071 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-09-11 19:37:36,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:37:36,074 INFO L225 Difference]: With dead ends: 50 [2024-09-11 19:37:36,074 INFO L226 Difference]: Without dead ends: 42 [2024-09-11 19:37:36,075 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-09-11 19:37:36,075 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:37:36,076 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 196 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:37:36,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-09-11 19:37:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-09-11 19:37:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 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 19:37:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-09-11 19:37:36,100 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 44 [2024-09-11 19:37:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:37:36,101 INFO L474 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-09-11 19:37:36,101 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:37:36,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-09-11 19:37:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-11 19:37:36,103 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:37:36,103 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:37:36,120 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 19:37:36,304 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 19:37:36,304 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:37:36,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:37:36,305 INFO L85 PathProgramCache]: Analyzing trace with hash -282333130, now seen corresponding path program 1 times [2024-09-11 19:37:36,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:37:36,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074561261] [2024-09-11 19:37:36,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:36,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:37:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:36,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:37:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:36,671 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:37:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:36,681 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:37:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:36,684 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:37:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 19:37:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:37:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074561261] [2024-09-11 19:37:36,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074561261] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:37:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397075320] [2024-09-11 19:37:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:37:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:37:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:37:36,690 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 19:37:36,691 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 19:37:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:37:36,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-09-11 19:37:36,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:37:36,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-09-11 19:37:36,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-09-11 19:37:36,923 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-09-11 19:37:36,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-09-11 19:37:36,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-09-11 19:37:37,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-09-11 19:37:37,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2024-09-11 19:37:37,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-09-11 19:37:37,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2024-09-11 19:37:37,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-09-11 19:37:37,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2024-09-11 19:37:37,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2024-09-11 19:37:37,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2024-09-11 19:37:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 19:37:38,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:37:52,357 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_upsweep_~a#1.offset_16| Int) (|v_ULTIMATE.start_upsweep_~left~0#1_29| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_221 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int)) (or (let ((.cse8 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse8) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse8))) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4 .cse8) v_ArrVal_221)))) (let ((.cse2 (store (let ((.cse7 (* |v_ULTIMATE.start_upsweep_~left~0#1_29| 4))) (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| 4 .cse7))) (store .cse5 .cse6 (+ (select .cse5 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| .cse7)) (select .cse5 .cse6))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4 .cse8) 0)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (select .cse2 .cse3))) (let ((.cse0 (+ .cse4 (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|)))) (= .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse0) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|))))))) (< |v_ULTIMATE.start_upsweep_~a#1.offset_16| |ULTIMATE.start_main_~a~0#1.offset|) (< |v_ULTIMATE.start_upsweep_~left~0#1_29| 0))) is different from false [2024-09-11 19:38:01,506 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_upsweep_~a#1.offset_16| Int) (|v_ULTIMATE.start_upsweep_~left~0#1_29| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_228 (Array Int Int)) (v_ArrVal_221 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int)) (or (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store v_ArrVal_228 |ULTIMATE.start_main_~a0~0#1.offset| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) v_ArrVal_221)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|))) (= .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse4 (* |v_ULTIMATE.start_upsweep_~left~0#1_29| 4))) (let ((.cse3 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| 4 .cse4))) (store .cse2 .cse3 (+ (select .cse2 .cse3) (select .cse2 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| .cse4)))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4) .cse0) |ULTIMATE.start_main_~a~0#1.offset| 0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|))))) (< |v_ULTIMATE.start_upsweep_~a#1.offset_16| |ULTIMATE.start_main_~a~0#1.offset|) (< |v_ULTIMATE.start_upsweep_~left~0#1_29| 0))) is different from false [2024-09-11 19:38:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397075320] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:38:01,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 19:38:01,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23] total 29 [2024-09-11 19:38:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787300881] [2024-09-11 19:38:01,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 19:38:01,510 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-11 19:38:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:38:01,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-11 19:38:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1551, Unknown=4, NotChecked=162, Total=1892 [2024-09-11 19:38:01,513 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-11 19:38:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:03,853 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2024-09-11 19:38:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-09-11 19:38:03,853 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2024-09-11 19:38:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:03,855 INFO L225 Difference]: With dead ends: 115 [2024-09-11 19:38:03,855 INFO L226 Difference]: Without dead ends: 94 [2024-09-11 19:38:03,857 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=433, Invalid=4263, Unknown=4, NotChecked=270, Total=4970 [2024-09-11 19:38:03,857 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 98 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:03,858 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 303 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-09-11 19:38:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-09-11 19:38:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2024-09-11 19:38:03,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:38:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-09-11 19:38:03,876 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 45 [2024-09-11 19:38:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:03,876 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-09-11 19:38:03,877 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-11 19:38:03,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-09-11 19:38:03,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-11 19:38:03,878 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:03,878 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:38:03,894 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 19:38:04,082 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 19:38:04,083 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:04,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:04,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1561050569, now seen corresponding path program 2 times [2024-09-11 19:38:04,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:04,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770455951] [2024-09-11 19:38:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:04,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:04,297 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:04,299 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:38:04,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:04,310 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:38:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:04,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:38:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:38:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770455951] [2024-09-11 19:38:04,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770455951] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:38:04,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130673000] [2024-09-11 19:38:04,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:38:04,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:38:04,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:38:04,320 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 19:38:04,323 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 19:38:04,431 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:38:04,431 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:38:04,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-11 19:38:04,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:38:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:38:04,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:38:04,606 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:38:04,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130673000] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:38:04,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:38:04,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2024-09-11 19:38:04,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741477460] [2024-09-11 19:38:04,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:38:04,607 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-09-11 19:38:04,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:38:04,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-09-11 19:38:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-09-11 19:38:04,609 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:38:04,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:04,851 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2024-09-11 19:38:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 19:38:04,852 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2024-09-11 19:38:04,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:04,853 INFO L225 Difference]: With dead ends: 104 [2024-09-11 19:38:04,853 INFO L226 Difference]: Without dead ends: 85 [2024-09-11 19:38:04,853 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-09-11 19:38:04,854 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:04,854 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 234 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:38:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-09-11 19:38:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2024-09-11 19:38:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:38:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-09-11 19:38:04,879 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 46 [2024-09-11 19:38:04,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:04,879 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-09-11 19:38:04,880 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:38:04,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-09-11 19:38:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-11 19:38:04,881 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:04,881 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:38:04,898 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-11 19:38:05,085 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 19:38:05,086 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:05,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1845532929, now seen corresponding path program 3 times [2024-09-11 19:38:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352091888] [2024-09-11 19:38:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:05,213 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:05,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-09-11 19:38:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:05,226 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-11 19:38:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:05,229 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 19:38:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:38:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:05,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352091888] [2024-09-11 19:38:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352091888] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:38:05,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697651563] [2024-09-11 19:38:05,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:38:05,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:38:05,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:38:05,233 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 19:38:05,235 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 19:38:05,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-11 19:38:05,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:38:05,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 19:38:05,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:38:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-11 19:38:05,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:38:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-11 19:38:05,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697651563] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:38:05,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:38:05,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2024-09-11 19:38:05,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256580131] [2024-09-11 19:38:05,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:38:05,992 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-11 19:38:05,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:38:05,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-11 19:38:05,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-09-11 19:38:05,994 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:38:06,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:06,833 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2024-09-11 19:38:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-11 19:38:06,835 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 47 [2024-09-11 19:38:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:06,837 INFO L225 Difference]: With dead ends: 129 [2024-09-11 19:38:06,837 INFO L226 Difference]: Without dead ends: 114 [2024-09-11 19:38:06,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2024-09-11 19:38:06,838 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 52 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:06,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 460 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-11 19:38:06,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-09-11 19:38:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2024-09-11 19:38:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:38:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2024-09-11 19:38:06,879 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 47 [2024-09-11 19:38:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:06,879 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2024-09-11 19:38:06,879 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-09-11 19:38:06,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:06,880 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2024-09-11 19:38:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-11 19:38:06,881 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:06,881 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:38:06,898 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-11 19:38:07,085 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 19:38:07,086 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:07,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:07,086 INFO L85 PathProgramCache]: Analyzing trace with hash 308391347, now seen corresponding path program 1 times [2024-09-11 19:38:07,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:07,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745324957] [2024-09-11 19:38:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:07,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:07,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:07,255 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:38:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:07,263 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:38:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:07,265 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:38:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:07,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-11 19:38:07,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:07,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745324957] [2024-09-11 19:38:07,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745324957] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:38:07,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897403606] [2024-09-11 19:38:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:07,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:38:07,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:38:07,270 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 19:38:07,271 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 19:38:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:07,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-11 19:38:07,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:38:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-11 19:38:07,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:38:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-11 19:38:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897403606] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:38:07,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:38:07,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 10 [2024-09-11 19:38:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202907066] [2024-09-11 19:38:07,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:38:07,491 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-11 19:38:07,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:38:07,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-11 19:38:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:38:07,492 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:38:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:07,625 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2024-09-11 19:38:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 19:38:07,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-09-11 19:38:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:07,626 INFO L225 Difference]: With dead ends: 109 [2024-09-11 19:38:07,626 INFO L226 Difference]: Without dead ends: 93 [2024-09-11 19:38:07,626 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-11 19:38:07,627 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:07,627 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 126 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 19:38:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-11 19:38:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2024-09-11 19:38:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:38:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-09-11 19:38:07,660 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 49 [2024-09-11 19:38:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:07,661 INFO L474 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-09-11 19:38:07,661 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:38:07,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-09-11 19:38:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-09-11 19:38:07,664 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:07,665 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:38:07,683 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 19:38:07,865 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 19:38:07,866 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:07,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:07,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1884320915, now seen corresponding path program 2 times [2024-09-11 19:38:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201500382] [2024-09-11 19:38:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:08,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:08,099 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:38:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:08,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:38:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:08,114 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:38:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 19:38:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:08,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201500382] [2024-09-11 19:38:08,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201500382] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:38:08,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440525878] [2024-09-11 19:38:08,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 19:38:08,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:38:08,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:38:08,119 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:38:08,121 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 19:38:08,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 19:38:08,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:38:08,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-11 19:38:08,245 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:38:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:38:08,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 19:38:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:38:08,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440525878] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 19:38:08,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 19:38:08,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2024-09-11 19:38:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826296003] [2024-09-11 19:38:08,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 19:38:08,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-11 19:38:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 19:38:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-11 19:38:08,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-09-11 19:38:08,502 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:38:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 19:38:08,775 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2024-09-11 19:38:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 19:38:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-09-11 19:38:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 19:38:08,777 INFO L225 Difference]: With dead ends: 124 [2024-09-11 19:38:08,777 INFO L226 Difference]: Without dead ends: 105 [2024-09-11 19:38:08,777 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-09-11 19:38:08,778 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 19:38:08,778 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 19:38:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-09-11 19:38:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-09-11 19:38:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 19:38:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2024-09-11 19:38:08,819 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 49 [2024-09-11 19:38:08,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 19:38:08,820 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2024-09-11 19:38:08,820 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-11 19:38:08,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2024-09-11 19:38:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 19:38:08,821 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 19:38:08,821 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 19:38:08,836 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-09-11 19:38:09,025 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:38:09,026 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 19:38:09,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 19:38:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1299814628, now seen corresponding path program 3 times [2024-09-11 19:38:09,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 19:38:09,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508958404] [2024-09-11 19:38:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 19:38:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 19:38:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:09,152 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-09-11 19:38:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:09,154 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-09-11 19:38:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:09,163 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-09-11 19:38:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:09,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-11 19:38:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 19:38:09,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 19:38:09,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 19:38:09,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508958404] [2024-09-11 19:38:09,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508958404] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 19:38:09,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086133729] [2024-09-11 19:38:09,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 19:38:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 19:38:09,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 19:38:09,170 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 19:38:09,172 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-11 19:38:09,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 19:38:09,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 19:38:09,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-09-11 19:38:09,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 19:38:09,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-09-11 19:38:09,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-09-11 19:38:09,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-09-11 19:38:09,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-09-11 19:38:09,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-09-11 19:38:09,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2024-09-11 19:38:09,869 INFO L349 Elim1Store]: treesize reduction 40, result has 52.9 percent of original size [2024-09-11 19:38:09,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 70 [2024-09-11 19:38:10,752 INFO L349 Elim1Store]: treesize reduction 68, result has 49.3 percent of original size [2024-09-11 19:38:10,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 136 [2024-09-11 19:38:12,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-09-11 19:38:13,201 INFO L349 Elim1Store]: treesize reduction 337, result has 41.6 percent of original size [2024-09-11 19:38:13,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 213 treesize of output 341 [2024-09-11 19:41:20,866 WARN L293 SmtUtils]: Spent 26.83s on a formula simplification. DAG size of input: 1366 DAG size of output: 1366 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)