./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested3-1.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/nested3-1.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 ed8e064f31e82b4c33cb383334d25637eef982ae8d5b8603579b97c7fdfe808e --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:31:55,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:31:55,423 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:31:55,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:31:55,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:31:55,462 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:31:55,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:31:55,463 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:31:55,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:31:55,464 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:31:55,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:31:55,465 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:31:55,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:31:55,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:31:55,468 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:31:55,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:31:55,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:31:55,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:31:55,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:31:55,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:31:55,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:31:55,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:31:55,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:31:55,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:31:55,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:31:55,475 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:31:55,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:31:55,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:31:55,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:31:55,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:31:55,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:31:55,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:31:55,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:55,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:31:55,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:31:55,479 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:31:55,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:31:55,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:31:55,480 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:31:55,480 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:31:55,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:31:55,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:31:55,481 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 -> ed8e064f31e82b4c33cb383334d25637eef982ae8d5b8603579b97c7fdfe808e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:31:55,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:31:55,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:31:55,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:31:55,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:31:55,840 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:31:55,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/nested3-1.c [2024-09-25 10:31:57,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:31:57,651 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:31:57,653 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/nested3-1.c [2024-09-25 10:31:57,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/5c51dd8f9/c2d65f76a84540c186f7637f54bf050d/FLAG3b123cec0 [2024-09-25 10:31:57,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/5c51dd8f9/c2d65f76a84540c186f7637f54bf050d [2024-09-25 10:31:57,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:31:57,683 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:31:57,684 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:57,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:31:57,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:31:57,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:57,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44368326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57, skipping insertion in model container [2024-09-25 10:31:57,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:57,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:31:57,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/nested3-1.c[321,334] [2024-09-25 10:31:57,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:57,914 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:31:57,930 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/nested3-1.c[321,334] [2024-09-25 10:31:57,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:57,952 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:31:57,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57 WrapperNode [2024-09-25 10:31:57,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:57,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:57,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:31:57,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:31:57,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:57,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:57,974 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:31:57,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:57,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:31:57,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:31:57,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:31:57,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:57,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:57,986 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,000 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:31:58,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:31:58,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:31:58,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:31:58,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:31:58,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (1/1) ... [2024-09-25 10:31:58,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:58,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:58,046 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:31:58,050 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:31:58,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:31:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:31:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:31:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:31:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:31:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:31:58,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:31:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:31:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:31:58,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:31:58,154 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:31:58,156 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:31:58,335 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-09-25 10:31:58,335 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:31:58,359 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:31:58,359 INFO L317 CfgBuilder]: Removed 3 assume(true) statements. [2024-09-25 10:31:58,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:58 BoogieIcfgContainer [2024-09-25 10:31:58,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:31:58,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:31:58,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:31:58,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:31:58,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:31:57" (1/3) ... [2024-09-25 10:31:58,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1dd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:58, skipping insertion in model container [2024-09-25 10:31:58,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:57" (2/3) ... [2024-09-25 10:31:58,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1dd83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:58, skipping insertion in model container [2024-09-25 10:31:58,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:58" (3/3) ... [2024-09-25 10:31:58,369 INFO L112 eAbstractionObserver]: Analyzing ICFG nested3-1.c [2024-09-25 10:31:58,384 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:31:58,385 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:31:58,446 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:31:58,453 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;@1ae10d02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:31:58,454 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:31:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:31:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-25 10:31:58,465 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:58,465 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:58,466 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:58,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash -91449342, now seen corresponding path program 1 times [2024-09-25 10:31:58,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:58,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589737792] [2024-09-25 10:31:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:58,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:58,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589737792] [2024-09-25 10:31:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589737792] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:58,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284373331] [2024-09-25 10:31:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:58,712 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:58,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:58,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:58,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:58,737 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:58,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:58,790 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2024-09-25 10:31:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:58,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-25 10:31:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:58,801 INFO L225 Difference]: With dead ends: 48 [2024-09-25 10:31:58,802 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 10:31:58,805 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:58,811 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:58,813 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 46 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:58,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 10:31:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2024-09-25 10:31:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-09-25 10:31:58,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 10 [2024-09-25 10:31:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:58,857 INFO L474 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-09-25 10:31:58,858 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:58,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:58,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-09-25 10:31:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:31:58,860 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:58,860 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:58,861 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:31:58,861 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:58,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1474394065, now seen corresponding path program 1 times [2024-09-25 10:31:58,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933708576] [2024-09-25 10:31:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:58,972 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:58,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933708576] [2024-09-25 10:31:58,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933708576] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:58,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:58,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:58,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496192999] [2024-09-25 10:31:58,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:58,988 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:58,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:58,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:58,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:58,990 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:59,016 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-09-25 10:31:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:59,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:31:59,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:59,020 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:31:59,020 INFO L226 Difference]: Without dead ends: 24 [2024-09-25 10:31:59,020 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:59,022 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:59,023 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-09-25 10:31:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2024-09-25 10:31:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-09-25 10:31:59,032 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 11 [2024-09-25 10:31:59,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:59,033 INFO L474 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-09-25 10:31:59,033 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-09-25 10:31:59,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-25 10:31:59,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:59,036 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:59,036 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:31:59,037 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:59,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1513968721, now seen corresponding path program 1 times [2024-09-25 10:31:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:59,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391079996] [2024-09-25 10:31:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:59,122 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:59,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:59,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391079996] [2024-09-25 10:31:59,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391079996] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:59,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:59,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:59,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239770827] [2024-09-25 10:31:59,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:59,135 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:59,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:59,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:59,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:59,136 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:59,161 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-09-25 10:31:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:59,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-25 10:31:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:59,163 INFO L225 Difference]: With dead ends: 37 [2024-09-25 10:31:59,163 INFO L226 Difference]: Without dead ends: 22 [2024-09-25 10:31:59,164 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:59,165 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:59,165 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:59,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-25 10:31:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-25 10:31:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-09-25 10:31:59,175 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2024-09-25 10:31:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:59,175 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-09-25 10:31:59,176 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-09-25 10:31:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:31:59,177 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:59,177 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:59,177 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:31:59,179 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:59,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash 337912467, now seen corresponding path program 1 times [2024-09-25 10:31:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436549173] [2024-09-25 10:31:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:59,294 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:59,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:59,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:59,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436549173] [2024-09-25 10:31:59,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436549173] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:59,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278142139] [2024-09-25 10:31:59,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:59,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:59,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:59,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:59,308 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:31:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:59,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:31:59,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:59,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:59,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:59,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278142139] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:59,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:59,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2024-09-25 10:31:59,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287130621] [2024-09-25 10:31:59,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:59,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:31:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:59,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:31:59,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:31:59,502 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:59,667 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2024-09-25 10:31:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:31:59,668 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-25 10:31:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:59,671 INFO L225 Difference]: With dead ends: 61 [2024-09-25 10:31:59,671 INFO L226 Difference]: Without dead ends: 45 [2024-09-25 10:31:59,672 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:31:59,673 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:59,673 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 176 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-09-25 10:31:59,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2024-09-25 10:31:59,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:31:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-09-25 10:31:59,682 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 13 [2024-09-25 10:31:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:59,683 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-09-25 10:31:59,683 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 9 states have internal predecessors, (18), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:59,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-09-25 10:31:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-25 10:31:59,684 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:59,684 INFO L216 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:59,699 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-25 10:31:59,885 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:59,885 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:59,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -304397137, now seen corresponding path program 2 times [2024-09-25 10:31:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:59,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87533459] [2024-09-25 10:31:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:00,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:00,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:32:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87533459] [2024-09-25 10:32:00,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87533459] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:00,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314329691] [2024-09-25 10:32:00,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:32:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:00,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:32:00,075 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:32:00,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:32:00,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:32:00,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-25 10:32:00,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:32:00,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:32:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314329691] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:00,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:00,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-09-25 10:32:00,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600263463] [2024-09-25 10:32:00,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:00,245 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-09-25 10:32:00,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:00,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-09-25 10:32:00,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-09-25 10:32:00,246 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:00,435 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-09-25 10:32:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-25 10:32:00,436 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-09-25 10:32:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:00,436 INFO L225 Difference]: With dead ends: 55 [2024-09-25 10:32:00,436 INFO L226 Difference]: Without dead ends: 31 [2024-09-25 10:32:00,437 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:32:00,438 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:00,438 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:32:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-09-25 10:32:00,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-09-25 10:32:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.173913043478261) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:32:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-09-25 10:32:00,445 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2024-09-25 10:32:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:00,445 INFO L474 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-09-25 10:32:00,445 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:00,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-09-25 10:32:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-25 10:32:00,446 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:00,447 INFO L216 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:00,463 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-25 10:32:00,647 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:00,648 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:00,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:00,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2050377169, now seen corresponding path program 3 times [2024-09-25 10:32:00,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:00,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223870730] [2024-09-25 10:32:00,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:00,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:00,897 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:32:00,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:00,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223870730] [2024-09-25 10:32:00,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223870730] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:00,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632225148] [2024-09-25 10:32:00,905 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:32:00,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:00,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:00,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:32:00,908 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:32:00,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:32:00,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:32:00,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:32:00,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-25 10:32:01,255 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:32:01,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632225148] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:32:01,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:32:01,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 17 [2024-09-25 10:32:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188357665] [2024-09-25 10:32:01,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:32:01,256 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:32:01,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:01,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:32:01,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:32:01,257 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:01,376 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2024-09-25 10:32:01,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:32:01,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-09-25 10:32:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:01,379 INFO L225 Difference]: With dead ends: 38 [2024-09-25 10:32:01,379 INFO L226 Difference]: Without dead ends: 36 [2024-09-25 10:32:01,380 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2024-09-25 10:32:01,382 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:01,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:32:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-09-25 10:32:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-09-25 10:32:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:32:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-09-25 10:32:01,399 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2024-09-25 10:32:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:01,399 INFO L474 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-09-25 10:32:01,400 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:01,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-09-25 10:32:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 10:32:01,402 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:01,402 INFO L216 NwaCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:01,420 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-25 10:32:01,607 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:32:01,608 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:01,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:01,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1587762515, now seen corresponding path program 1 times [2024-09-25 10:32:01,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:01,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136810091] [2024-09-25 10:32:01,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:01,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:01,823 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:01,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-09-25 10:32:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:01,829 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 3 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:32:01,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:01,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136810091] [2024-09-25 10:32:01,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136810091] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:01,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200601049] [2024-09-25 10:32:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:01,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:01,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:01,834 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:32:01,835 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:32:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:01,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-09-25 10:32:01,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:32:01,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-09-25 10:32:02,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200601049] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:02,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:02,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 21 [2024-09-25 10:32:02,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053204744] [2024-09-25 10:32:02,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:02,137 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-25 10:32:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:02,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-25 10:32:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-09-25 10:32:02,138 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:32:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:03,050 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2024-09-25 10:32:03,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-09-25 10:32:03,051 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 29 [2024-09-25 10:32:03,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:03,052 INFO L225 Difference]: With dead ends: 110 [2024-09-25 10:32:03,052 INFO L226 Difference]: Without dead ends: 81 [2024-09-25 10:32:03,054 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=618, Invalid=3542, Unknown=0, NotChecked=0, Total=4160 [2024-09-25 10:32:03,055 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:03,055 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 269 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:32:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-25 10:32:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-09-25 10:32:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 70 states have internal predecessors, (76), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:32:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2024-09-25 10:32:03,078 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 29 [2024-09-25 10:32:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:03,082 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2024-09-25 10:32:03,082 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 21 states have internal predecessors, (39), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:32:03,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2024-09-25 10:32:03,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-09-25 10:32:03,095 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:03,095 INFO L216 NwaCegarLoop]: trace histogram [44, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:03,109 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:32:03,296 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:03,296 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:03,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1307739729, now seen corresponding path program 2 times [2024-09-25 10:32:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435703974] [2024-09-25 10:32:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:03,687 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:03,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-25 10:32:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:03,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-09-25 10:32:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:03,693 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-09-25 10:32:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:03,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-09-25 10:32:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 444 proven. 66 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-09-25 10:32:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435703974] [2024-09-25 10:32:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435703974] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:03,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515383540] [2024-09-25 10:32:03,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:32:03,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:03,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:03,700 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:32:03,702 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:32:03,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:32:03,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:32:03,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-25 10:32:03,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 8 proven. 931 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-09-25 10:32:04,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1182 backedges. 43 proven. 896 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-09-25 10:32:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515383540] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:04,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 34 [2024-09-25 10:32:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906244214] [2024-09-25 10:32:04,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:04,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-25 10:32:04,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-25 10:32:04,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2024-09-25 10:32:04,581 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:32:08,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:08,688 INFO L93 Difference]: Finished difference Result 256 states and 302 transitions. [2024-09-25 10:32:08,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-09-25 10:32:08,688 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 87 [2024-09-25 10:32:08,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:08,690 INFO L225 Difference]: With dead ends: 256 [2024-09-25 10:32:08,690 INFO L226 Difference]: Without dead ends: 181 [2024-09-25 10:32:08,700 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8825 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3165, Invalid=21327, Unknown=0, NotChecked=0, Total=24492 [2024-09-25 10:32:08,701 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 97 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:08,701 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 537 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-25 10:32:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-09-25 10:32:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-09-25 10:32:08,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.0797546012269938) internal successors, (176), 164 states have internal predecessors, (176), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:32:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 202 transitions. [2024-09-25 10:32:08,754 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 202 transitions. Word has length 87 [2024-09-25 10:32:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:08,755 INFO L474 AbstractCegarLoop]: Abstraction has 181 states and 202 transitions. [2024-09-25 10:32:08,755 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 34 states have internal predecessors, (73), 10 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-25 10:32:08,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 202 transitions. [2024-09-25 10:32:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-09-25 10:32:08,760 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:08,760 INFO L216 NwaCegarLoop]: trace histogram [120, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:08,779 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:32:08,966 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:32:08,967 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:08,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:08,967 INFO L85 PathProgramCache]: Analyzing trace with hash 709816549, now seen corresponding path program 3 times [2024-09-25 10:32:08,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:08,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757352802] [2024-09-25 10:32:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:08,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,715 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,718 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-09-25 10:32:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-09-25 10:32:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,722 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-09-25 10:32:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-09-25 10:32:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-09-25 10:32:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,727 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-09-25 10:32:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-25 10:32:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,730 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-09-25 10:32:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,732 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-09-25 10:32:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-09-25 10:32:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:09,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8730 backedges. 1551 proven. 78 refuted. 0 times theorem prover too weak. 7101 trivial. 0 not checked. [2024-09-25 10:32:09,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:09,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757352802] [2024-09-25 10:32:09,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757352802] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:09,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705028408] [2024-09-25 10:32:09,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:32:09,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:09,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:09,741 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:32:09,745 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:32:09,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-09-25 10:32:09,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:32:09,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-09-25 10:32:09,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8730 backedges. 1447 proven. 1548 refuted. 0 times theorem prover too weak. 5735 trivial. 0 not checked. [2024-09-25 10:32:09,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8730 backedges. 1569 proven. 78 refuted. 0 times theorem prover too weak. 7083 trivial. 0 not checked. [2024-09-25 10:32:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705028408] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:10,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2024-09-25 10:32:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506904321] [2024-09-25 10:32:10,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:10,257 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-09-25 10:32:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-09-25 10:32:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2024-09-25 10:32:10,259 INFO L87 Difference]: Start difference. First operand 181 states and 202 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:32:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:15,029 INFO L93 Difference]: Finished difference Result 496 states and 678 transitions. [2024-09-25 10:32:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-09-25 10:32:15,030 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 211 [2024-09-25 10:32:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:15,032 INFO L225 Difference]: With dead ends: 496 [2024-09-25 10:32:15,032 INFO L226 Difference]: Without dead ends: 321 [2024-09-25 10:32:15,034 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=598, Invalid=1042, Unknown=0, NotChecked=0, Total=1640 [2024-09-25 10:32:15,034 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:15,034 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:32:15,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-09-25 10:32:15,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-09-25 10:32:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 303 states have (on average 1.0429042904290429) internal successors, (316), 304 states have internal predecessors, (316), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:32:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 342 transitions. [2024-09-25 10:32:15,085 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 342 transitions. Word has length 211 [2024-09-25 10:32:15,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:15,085 INFO L474 AbstractCegarLoop]: Abstraction has 321 states and 342 transitions. [2024-09-25 10:32:15,085 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:32:15,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:15,086 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 342 transitions. [2024-09-25 10:32:15,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-09-25 10:32:15,090 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:15,090 INFO L216 NwaCegarLoop]: trace histogram [260, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:15,106 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:32:15,294 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:15,295 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:15,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -434978715, now seen corresponding path program 4 times [2024-09-25 10:32:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961784816] [2024-09-25 10:32:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,070 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,073 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-09-25 10:32:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-09-25 10:32:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,077 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-09-25 10:32:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-09-25 10:32:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-09-25 10:32:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,084 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-09-25 10:32:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-09-25 10:32:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-09-25 10:32:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2024-09-25 10:32:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,101 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2024-09-25 10:32:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 36660 backedges. 6591 proven. 351 refuted. 0 times theorem prover too weak. 29718 trivial. 0 not checked. [2024-09-25 10:32:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961784816] [2024-09-25 10:32:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961784816] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087601605] [2024-09-25 10:32:17,117 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:32:17,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:17,119 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-25 10:32:17,121 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-25 10:32:17,330 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:32:17,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:32:17,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-25 10:32:17,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 36660 backedges. 20 proven. 33181 refuted. 0 times theorem prover too weak. 3459 trivial. 0 not checked. [2024-09-25 10:32:18,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:19,651 INFO L134 CoverageAnalysis]: Checked inductivity of 36660 backedges. 196 proven. 33005 refuted. 0 times theorem prover too weak. 3459 trivial. 0 not checked. [2024-09-25 10:32:19,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087601605] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:19,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:19,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 73 [2024-09-25 10:32:19,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398858802] [2024-09-25 10:32:19,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:19,653 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2024-09-25 10:32:19,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:19,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2024-09-25 10:32:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=4559, Unknown=0, NotChecked=0, Total=5256 [2024-09-25 10:32:19,656 INFO L87 Difference]: Start difference. First operand 321 states and 342 transitions. Second operand has 73 states, 73 states have (on average 2.0273972602739727) internal successors, (148), 73 states have internal predecessors, (148), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-25 10:34:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:34:33,564 INFO L93 Difference]: Finished difference Result 1018 states and 1118 transitions. [2024-09-25 10:34:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 628 states. [2024-09-25 10:34:33,564 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 2.0273972602739727) internal successors, (148), 73 states have internal predecessors, (148), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 351 [2024-09-25 10:34:33,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:34:33,568 INFO L225 Difference]: With dead ends: 1018 [2024-09-25 10:34:33,568 INFO L226 Difference]: Without dead ends: 703 [2024-09-25 10:34:33,596 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1356 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 674 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196022 ImplicationChecksByTransitivity, 131.2s TimeCoverageRelationStatistics Valid=29805, Invalid=426495, Unknown=0, NotChecked=0, Total=456300 [2024-09-25 10:34:33,597 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 396 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 11787 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 11823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 11787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-09-25 10:34:33,597 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 870 Invalid, 11823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 11787 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-09-25 10:34:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2024-09-25 10:34:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 703. [2024-09-25 10:34:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 673 states have (on average 1.037147102526003) internal successors, (698), 674 states have internal predecessors, (698), 26 states have call successors, (26), 4 states have call predecessors, (26), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-09-25 10:34:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 748 transitions. [2024-09-25 10:34:33,751 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 748 transitions. Word has length 351 [2024-09-25 10:34:33,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:34:33,751 INFO L474 AbstractCegarLoop]: Abstraction has 703 states and 748 transitions. [2024-09-25 10:34:33,751 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 2.0273972602739727) internal successors, (148), 73 states have internal predecessors, (148), 22 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-09-25 10:34:33,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 748 transitions. [2024-09-25 10:34:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 782 [2024-09-25 10:34:33,767 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:34:33,768 INFO L216 NwaCegarLoop]: trace histogram [594, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:34:33,787 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 10:34:33,968 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:33,969 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:34:33,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:33,969 INFO L85 PathProgramCache]: Analyzing trace with hash 674821009, now seen corresponding path program 5 times [2024-09-25 10:34:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:34:33,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291468327] [2024-09-25 10:34:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:34:33,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:34:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,830 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:34:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-25 10:34:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-09-25 10:34:37,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,839 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-09-25 10:34:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,840 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-09-25 10:34:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,842 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-09-25 10:34:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,843 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-09-25 10:34:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-09-25 10:34:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,846 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-09-25 10:34:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,847 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2024-09-25 10:34:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2024-09-25 10:34:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,850 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 385 [2024-09-25 10:34:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 420 [2024-09-25 10:34:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2024-09-25 10:34:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 490 [2024-09-25 10:34:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,856 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 525 [2024-09-25 10:34:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 560 [2024-09-25 10:34:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,858 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 595 [2024-09-25 10:34:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,861 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 630 [2024-09-25 10:34:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 665 [2024-09-25 10:34:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,863 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 700 [2024-09-25 10:34:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,865 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 735 [2024-09-25 10:34:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 770 [2024-09-25 10:34:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 191103 backedges. 16530 proven. 378 refuted. 0 times theorem prover too weak. 174195 trivial. 0 not checked. [2024-09-25 10:34:37,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:34:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291468327] [2024-09-25 10:34:37,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291468327] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:34:37,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036619180] [2024-09-25 10:34:37,875 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:34:37,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:34:37,877 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-25 10:34:37,878 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-25 10:34:43,128 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2024-09-25 10:34:43,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:34:43,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-09-25 10:34:43,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:34:43,227 INFO L134 CoverageAnalysis]: Checked inductivity of 191103 backedges. 59224 proven. 378 refuted. 0 times theorem prover too weak. 131501 trivial. 0 not checked. [2024-09-25 10:34:43,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:34:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 191103 backedges. 59034 proven. 378 refuted. 0 times theorem prover too weak. 131691 trivial. 0 not checked. [2024-09-25 10:34:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036619180] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:34:44,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:34:44,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2024-09-25 10:34:44,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310043545] [2024-09-25 10:34:44,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:34:44,403 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-09-25 10:34:44,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:34:44,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-09-25 10:34:44,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2024-09-25 10:34:44,405 INFO L87 Difference]: Start difference. First operand 703 states and 748 transitions. Second operand has 59 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:34:50,359 WARN L293 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 114 DAG size of output: 10 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)