./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/nested_delay_nd.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/nested_delay_nd.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 39463d01f5c85d47bf5e231172595e96b8ff556c59c4a9ab8cf46a88a393b05c --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:33:37,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:33:37,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:33:37,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:33:37,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:33:37,268 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:33:37,269 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:33:37,269 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:33:37,270 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:33:37,273 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:33:37,273 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:33:37,273 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:33:37,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:33:37,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:33:37,274 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:33:37,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:33:37,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:33:37,275 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:33:37,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:33:37,276 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:33:37,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:33:37,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:33:37,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:33:37,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:33:37,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:33:37,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:33:37,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:33:37,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:33:37,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:33:37,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:33:37,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:33:37,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:33:37,280 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:33:37,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:33:37,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:33:37,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:33:37,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:33:37,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:33:37,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:33:37,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:33:37,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:33:37,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:33:37,283 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 -> 39463d01f5c85d47bf5e231172595e96b8ff556c59c4a9ab8cf46a88a393b05c 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:33:37,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:33:37,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:33:37,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:33:37,596 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:33:37,596 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:33:37,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2024-09-25 10:33:39,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:33:39,287 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:33:39,288 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2024-09-25 10:33:39,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/3582690b6/2e8a82f7eb95462991be3a6ed7fb3ce8/FLAG05f4d94ea [2024-09-25 10:33:39,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/3582690b6/2e8a82f7eb95462991be3a6ed7fb3ce8 [2024-09-25 10:33:39,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:33:39,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:33:39,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:33:39,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:33:39,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:33:39,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a23c4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39, skipping insertion in model container [2024-09-25 10:33:39,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:33:39,846 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/nested_delay_nd.c[465,478] [2024-09-25 10:33:39,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:33:39,879 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:33:39,890 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/nested_delay_nd.c[465,478] [2024-09-25 10:33:39,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:33:39,930 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:33:39,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39 WrapperNode [2024-09-25 10:33:39,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:33:39,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:33:39,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:33:39,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:33:39,938 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:33:39" (1/1) ... [2024-09-25 10:33:39,944 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:33:39" (1/1) ... [2024-09-25 10:33:39,949 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:33:39,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:33:39,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:33:39,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:33:39,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:33:39,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,976 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:33:39,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,990 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:39,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:33:39,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:33:39,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:33:39,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:33:39,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (1/1) ... [2024-09-25 10:33:40,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:33:40,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:40,031 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:33:40,039 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:33:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:33:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-25 10:33:40,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-25 10:33:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:33:40,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:33:40,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:33:40,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:33:40,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:33:40,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:33:40,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:33:40,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:33:40,085 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:33:40,151 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:33:40,154 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:33:40,331 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-25 10:33:40,331 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:33:40,348 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:33:40,349 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:33:40,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:33:40 BoogieIcfgContainer [2024-09-25 10:33:40,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:33:40,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:33:40,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:33:40,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:33:40,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:33:39" (1/3) ... [2024-09-25 10:33:40,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0f94cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:33:40, skipping insertion in model container [2024-09-25 10:33:40,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:33:39" (2/3) ... [2024-09-25 10:33:40,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0f94cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:33:40, skipping insertion in model container [2024-09-25 10:33:40,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:33:40" (3/3) ... [2024-09-25 10:33:40,357 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_nd.c [2024-09-25 10:33:40,386 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:33:40,387 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:33:40,450 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:33:40,455 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;@2bc6052d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:33:40,455 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:33:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:33:40,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:33:40,464 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:40,465 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:40,465 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:40,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1899367790, now seen corresponding path program 1 times [2024-09-25 10:33:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:40,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796848460] [2024-09-25 10:33:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:40,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:40,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:40,696 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:33:40,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:40,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796848460] [2024-09-25 10:33:40,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796848460] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:33:40,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:33:40,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:33:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917029472] [2024-09-25 10:33:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:33:40,705 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:33:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:40,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:33:40,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:33:40,732 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.6) internal successors, (32), 22 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:40,842 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. [2024-09-25 10:33:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:33:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-25 10:33:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:40,849 INFO L225 Difference]: With dead ends: 48 [2024-09-25 10:33:40,849 INFO L226 Difference]: Without dead ends: 26 [2024-09-25 10:33:40,852 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:33:40,855 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:40,856 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-25 10:33:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-25 10:33:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:33:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-09-25 10:33:40,891 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 20 [2024-09-25 10:33:40,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:40,893 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-09-25 10:33:40,894 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:40,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-09-25 10:33:40,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-25 10:33:40,897 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:40,898 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:40,898 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:33:40,898 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:40,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash -678482725, now seen corresponding path program 1 times [2024-09-25 10:33:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:40,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712596994] [2024-09-25 10:33:40,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:40,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,095 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,110 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:33:41,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:41,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712596994] [2024-09-25 10:33:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712596994] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:33:41,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:33:41,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-25 10:33:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601960385] [2024-09-25 10:33:41,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:33:41,114 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-25 10:33:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-25 10:33:41,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-25 10:33:41,117 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:33:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:41,248 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-09-25 10:33:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:33:41,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-25 10:33:41,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:41,250 INFO L225 Difference]: With dead ends: 44 [2024-09-25 10:33:41,251 INFO L226 Difference]: Without dead ends: 29 [2024-09-25 10:33:41,252 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:33:41,253 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:41,255 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 13 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:41,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-25 10:33:41,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-25 10:33:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:33:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-25 10:33:41,266 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 20 [2024-09-25 10:33:41,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:41,267 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-25 10:33:41,268 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:33:41,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-25 10:33:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 10:33:41,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:41,270 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:41,270 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:33:41,270 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:41,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2109323453, now seen corresponding path program 1 times [2024-09-25 10:33:41,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:41,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141517136] [2024-09-25 10:33:41,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:41,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:33:41,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:41,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141517136] [2024-09-25 10:33:41,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141517136] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:33:41,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:33:41,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:33:41,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058617511] [2024-09-25 10:33:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:33:41,333 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:33:41,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:41,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:33:41,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:33:41,334 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:41,404 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-09-25 10:33:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:33:41,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-09-25 10:33:41,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:41,406 INFO L225 Difference]: With dead ends: 48 [2024-09-25 10:33:41,406 INFO L226 Difference]: Without dead ends: 32 [2024-09-25 10:33:41,407 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:33:41,409 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:41,410 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 29 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-25 10:33:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-09-25 10:33:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:33:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-25 10:33:41,422 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2024-09-25 10:33:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:41,423 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-25 10:33:41,423 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:41,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-25 10:33:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-25 10:33:41,424 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:41,424 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:41,424 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:33:41,425 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:41,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:41,425 INFO L85 PathProgramCache]: Analyzing trace with hash -334316091, now seen corresponding path program 1 times [2024-09-25 10:33:41,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:41,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595190315] [2024-09-25 10:33:41,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:41,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,530 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,552 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:33:41,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:41,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595190315] [2024-09-25 10:33:41,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595190315] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:41,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667376902] [2024-09-25 10:33:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:41,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:41,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:41,557 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:33:41,558 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:33:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:41,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:33:41,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:41,711 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:33:41,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:41,769 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:33:41,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667376902] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:41,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-09-25 10:33:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695112937] [2024-09-25 10:33:41,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:41,771 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-25 10:33:41,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-25 10:33:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-09-25 10:33:41,774 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:41,892 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-09-25 10:33:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:33:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 23 [2024-09-25 10:33:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:41,893 INFO L225 Difference]: With dead ends: 54 [2024-09-25 10:33:41,893 INFO L226 Difference]: Without dead ends: 37 [2024-09-25 10:33:41,895 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-09-25 10:33:41,897 INFO L434 NwaCegarLoop]: 11 mSDtfsCounter, 72 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:41,898 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 14 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-25 10:33:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-25 10:33:41,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:33:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-09-25 10:33:41,911 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 23 [2024-09-25 10:33:41,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:41,912 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-09-25 10:33:41,912 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:41,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-09-25 10:33:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-25 10:33:41,914 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:41,914 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:41,932 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:33:42,118 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:33:42,119 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:42,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:42,119 INFO L85 PathProgramCache]: Analyzing trace with hash -914591395, now seen corresponding path program 2 times [2024-09-25 10:33:42,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:42,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235189594] [2024-09-25 10:33:42,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:42,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:42,314 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:42,329 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:42,333 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:42,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:42,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235189594] [2024-09-25 10:33:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235189594] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147619336] [2024-09-25 10:33:42,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:33:42,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:42,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:42,346 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:33:42,348 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:33:42,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:33:42,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:42,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-25 10:33:42,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:33:42,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:42,553 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-25 10:33:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147619336] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:42,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:42,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2024-09-25 10:33:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913940420] [2024-09-25 10:33:42,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:42,557 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-25 10:33:42,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-25 10:33:42,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-09-25 10:33:42,561 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:33:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:43,522 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2024-09-25 10:33:43,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-25 10:33:43,524 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-09-25 10:33:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:43,526 INFO L225 Difference]: With dead ends: 178 [2024-09-25 10:33:43,528 INFO L226 Difference]: Without dead ends: 152 [2024-09-25 10:33:43,530 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=677, Invalid=2079, Unknown=0, NotChecked=0, Total=2756 [2024-09-25 10:33:43,531 INFO L434 NwaCegarLoop]: 12 mSDtfsCounter, 219 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:43,531 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 30 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-25 10:33:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-09-25 10:33:43,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2024-09-25 10:33:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 102 states have internal predecessors, (137), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-25 10:33:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2024-09-25 10:33:43,581 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 32 [2024-09-25 10:33:43,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:43,581 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2024-09-25 10:33:43,581 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-25 10:33:43,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:43,582 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2024-09-25 10:33:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-25 10:33:43,584 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:43,584 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:43,600 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-25 10:33:43,788 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:33:43,789 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:43,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2125730691, now seen corresponding path program 1 times [2024-09-25 10:33:43,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:43,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220900807] [2024-09-25 10:33:43,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:43,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:43,857 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-25 10:33:43,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:43,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220900807] [2024-09-25 10:33:43,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220900807] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:33:43,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:33:43,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:33:43,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908979955] [2024-09-25 10:33:43,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:33:43,861 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:33:43,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:43,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:33:43,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:33:43,862 INFO L87 Difference]: Start difference. First operand 113 states and 148 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:43,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:43,936 INFO L93 Difference]: Finished difference Result 222 states and 296 transitions. [2024-09-25 10:33:43,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:33:43,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2024-09-25 10:33:43,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:43,939 INFO L225 Difference]: With dead ends: 222 [2024-09-25 10:33:43,941 INFO L226 Difference]: Without dead ends: 120 [2024-09-25 10:33:43,942 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:33:43,943 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:43,943 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 33 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:43,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-25 10:33:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 83. [2024-09-25 10:33:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 74 states have internal predecessors, (95), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:33:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2024-09-25 10:33:43,971 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 35 [2024-09-25 10:33:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:43,972 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2024-09-25 10:33:43,972 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:43,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2024-09-25 10:33:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:33:43,973 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:43,974 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:43,974 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-25 10:33:43,974 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:43,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1071915545, now seen corresponding path program 1 times [2024-09-25 10:33:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406482959] [2024-09-25 10:33:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:44,012 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:44,016 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-25 10:33:44,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:44,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406482959] [2024-09-25 10:33:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406482959] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:33:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:33:44,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-25 10:33:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396437481] [2024-09-25 10:33:44,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:33:44,021 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-25 10:33:44,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:44,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-25 10:33:44,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:33:44,022 INFO L87 Difference]: Start difference. First operand 83 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:44,092 INFO L93 Difference]: Finished difference Result 160 states and 204 transitions. [2024-09-25 10:33:44,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-25 10:33:44,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-09-25 10:33:44,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:44,094 INFO L225 Difference]: With dead ends: 160 [2024-09-25 10:33:44,094 INFO L226 Difference]: Without dead ends: 88 [2024-09-25 10:33:44,097 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-25 10:33:44,098 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:44,098 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 30 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:33:44,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-25 10:33:44,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-25 10:33:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 79 states have internal predecessors, (100), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:33:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2024-09-25 10:33:44,125 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 36 [2024-09-25 10:33:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:44,126 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2024-09-25 10:33:44,127 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:44,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2024-09-25 10:33:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-25 10:33:44,128 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:44,129 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:44,129 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-25 10:33:44,129 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:44,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1014657243, now seen corresponding path program 1 times [2024-09-25 10:33:44,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:44,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653270557] [2024-09-25 10:33:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:44,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:44,259 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:44,267 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653270557] [2024-09-25 10:33:44,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653270557] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274910569] [2024-09-25 10:33:44,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:44,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:44,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:44,275 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:33:44,277 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:33:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:44,321 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-25 10:33:44,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:44,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:44,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274910569] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:44,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:44,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2024-09-25 10:33:44,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991655473] [2024-09-25 10:33:44,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:44,584 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-25 10:33:44,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:44,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-25 10:33:44,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=305, Unknown=0, NotChecked=0, Total=506 [2024-09-25 10:33:44,586 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:44,810 INFO L93 Difference]: Finished difference Result 239 states and 321 transitions. [2024-09-25 10:33:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-25 10:33:44,810 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-09-25 10:33:44,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:44,812 INFO L225 Difference]: With dead ends: 239 [2024-09-25 10:33:44,812 INFO L226 Difference]: Without dead ends: 162 [2024-09-25 10:33:44,812 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=308, Invalid=562, Unknown=0, NotChecked=0, Total=870 [2024-09-25 10:33:44,813 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:44,813 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 14 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:44,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-09-25 10:33:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2024-09-25 10:33:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 140 states have (on average 1.25) internal successors, (175), 141 states have internal predecessors, (175), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:33:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2024-09-25 10:33:44,851 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 36 [2024-09-25 10:33:44,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:44,851 INFO L474 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2024-09-25 10:33:44,853 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 22 states have internal predecessors, (71), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:44,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:44,854 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2024-09-25 10:33:44,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-25 10:33:44,855 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:44,855 INFO L216 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:44,872 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:33:45,055 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:33:45,056 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:45,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1524013939, now seen corresponding path program 2 times [2024-09-25 10:33:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776362594] [2024-09-25 10:33:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:45,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:45,397 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:45,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776362594] [2024-09-25 10:33:45,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776362594] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260854900] [2024-09-25 10:33:45,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:33:45,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:45,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:45,405 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:33:45,406 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:33:45,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:33:45,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:45,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-25 10:33:45,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:45,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260854900] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:46,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:46,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2024-09-25 10:33:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37736898] [2024-09-25 10:33:46,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:46,138 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-25 10:33:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-25 10:33:46,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=789, Invalid=1103, Unknown=0, NotChecked=0, Total=1892 [2024-09-25 10:33:46,140 INFO L87 Difference]: Start difference. First operand 150 states and 184 transitions. Second operand has 44 states, 44 states have (on average 3.0454545454545454) internal successors, (134), 43 states have internal predecessors, (134), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:46,635 INFO L93 Difference]: Finished difference Result 443 states and 595 transitions. [2024-09-25 10:33:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-25 10:33:46,636 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.0454545454545454) internal successors, (134), 43 states have internal predecessors, (134), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2024-09-25 10:33:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:46,638 INFO L225 Difference]: With dead ends: 443 [2024-09-25 10:33:46,638 INFO L226 Difference]: Without dead ends: 304 [2024-09-25 10:33:46,639 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1197, Invalid=2109, Unknown=0, NotChecked=0, Total=3306 [2024-09-25 10:33:46,640 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 264 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:46,640 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 15 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:33:46,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-09-25 10:33:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 276. [2024-09-25 10:33:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 266 states have (on average 1.236842105263158) internal successors, (329), 267 states have internal predecessors, (329), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:33:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 338 transitions. [2024-09-25 10:33:46,704 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 338 transitions. Word has length 57 [2024-09-25 10:33:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:46,704 INFO L474 AbstractCegarLoop]: Abstraction has 276 states and 338 transitions. [2024-09-25 10:33:46,704 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.0454545454545454) internal successors, (134), 43 states have internal predecessors, (134), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:46,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 338 transitions. [2024-09-25 10:33:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-09-25 10:33:46,706 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:46,707 INFO L216 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:46,723 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-25 10:33:46,910 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:46,911 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:46,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash -610331763, now seen corresponding path program 3 times [2024-09-25 10:33:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396972711] [2024-09-25 10:33:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:46,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:47,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:47,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:47,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:47,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396972711] [2024-09-25 10:33:47,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396972711] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:47,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239372384] [2024-09-25 10:33:47,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:33:47,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:47,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:47,586 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:33:47,587 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:33:47,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:33:47,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:47,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 10:33:47,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:48,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2024-09-25 10:33:48,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:33:48,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239372384] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:33:48,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:33:48,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [31] total 38 [2024-09-25 10:33:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064171348] [2024-09-25 10:33:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:33:48,054 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:33:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:48,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:33:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=976, Unknown=0, NotChecked=0, Total=1406 [2024-09-25 10:33:48,056 INFO L87 Difference]: Start difference. First operand 276 states and 338 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:48,205 INFO L93 Difference]: Finished difference Result 460 states and 556 transitions. [2024-09-25 10:33:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:33:48,206 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 99 [2024-09-25 10:33:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:48,209 INFO L225 Difference]: With dead ends: 460 [2024-09-25 10:33:48,209 INFO L226 Difference]: Without dead ends: 458 [2024-09-25 10:33:48,209 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=434, Invalid=1048, Unknown=0, NotChecked=0, Total=1482 [2024-09-25 10:33:48,210 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:48,210 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 92 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-09-25 10:33:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2024-09-25 10:33:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 442 states have (on average 1.2171945701357465) internal successors, (538), 444 states have internal predecessors, (538), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-25 10:33:48,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 551 transitions. [2024-09-25 10:33:48,284 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 551 transitions. Word has length 99 [2024-09-25 10:33:48,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:48,284 INFO L474 AbstractCegarLoop]: Abstraction has 456 states and 551 transitions. [2024-09-25 10:33:48,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:33:48,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 551 transitions. [2024-09-25 10:33:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-09-25 10:33:48,286 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:48,286 INFO L216 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:48,300 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-25 10:33:48,487 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-25 10:33:48,487 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:48,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:48,488 INFO L85 PathProgramCache]: Analyzing trace with hash -612178805, now seen corresponding path program 1 times [2024-09-25 10:33:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:48,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796337905] [2024-09-25 10:33:48,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:48,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:48,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2024-09-25 10:33:48,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796337905] [2024-09-25 10:33:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796337905] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:33:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:33:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:33:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344197796] [2024-09-25 10:33:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:33:48,659 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:33:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:48,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:33:48,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:33:48,661 INFO L87 Difference]: Start difference. First operand 456 states and 551 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:33:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:48,874 INFO L93 Difference]: Finished difference Result 978 states and 1200 transitions. [2024-09-25 10:33:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-25 10:33:48,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-09-25 10:33:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:48,879 INFO L225 Difference]: With dead ends: 978 [2024-09-25 10:33:48,880 INFO L226 Difference]: Without dead ends: 713 [2024-09-25 10:33:48,880 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:33:48,881 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 75 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:48,881 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 21 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:33:48,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-09-25 10:33:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2024-09-25 10:33:49,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 696 states have (on average 1.221264367816092) internal successors, (850), 699 states have internal predecessors, (850), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-25 10:33:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 869 transitions. [2024-09-25 10:33:49,017 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 869 transitions. Word has length 99 [2024-09-25 10:33:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:49,018 INFO L474 AbstractCegarLoop]: Abstraction has 713 states and 869 transitions. [2024-09-25 10:33:49,018 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:33:49,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:49,018 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 869 transitions. [2024-09-25 10:33:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-09-25 10:33:49,020 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:49,020 INFO L216 NwaCegarLoop]: trace histogram [26, 26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:49,020 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-25 10:33:49,020 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:49,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash 119150093, now seen corresponding path program 1 times [2024-09-25 10:33:49,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:49,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040838362] [2024-09-25 10:33:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:49,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:49,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:49,665 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:49,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040838362] [2024-09-25 10:33:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040838362] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355018344] [2024-09-25 10:33:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:49,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:49,671 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:33:49,673 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:33:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:49,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-25 10:33:49,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:50,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:50,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:51,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:51,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355018344] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:51,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:51,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 87 [2024-09-25 10:33:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666681857] [2024-09-25 10:33:51,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:51,569 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-09-25 10:33:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:51,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-09-25 10:33:51,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=4419, Unknown=0, NotChecked=0, Total=7482 [2024-09-25 10:33:51,573 INFO L87 Difference]: Start difference. First operand 713 states and 869 transitions. Second operand has 87 states, 87 states have (on average 3.0) internal successors, (261), 86 states have internal predecessors, (261), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:54,819 INFO L93 Difference]: Finished difference Result 2542 states and 3418 transitions. [2024-09-25 10:33:54,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-09-25 10:33:54,820 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 87 states have (on average 3.0) internal successors, (261), 86 states have internal predecessors, (261), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 99 [2024-09-25 10:33:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:54,829 INFO L225 Difference]: With dead ends: 2542 [2024-09-25 10:33:54,829 INFO L226 Difference]: Without dead ends: 1999 [2024-09-25 10:33:54,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10338 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=9966, Invalid=21186, Unknown=0, NotChecked=0, Total=31152 [2024-09-25 10:33:54,837 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 988 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:54,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 29 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:33:54,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-09-25 10:33:55,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1819. [2024-09-25 10:33:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1819 states, 1797 states have (on average 1.196438508625487) internal successors, (2150), 1801 states have internal predecessors, (2150), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2024-09-25 10:33:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2175 transitions. [2024-09-25 10:33:55,135 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2175 transitions. Word has length 99 [2024-09-25 10:33:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:55,136 INFO L474 AbstractCegarLoop]: Abstraction has 1819 states and 2175 transitions. [2024-09-25 10:33:55,136 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 3.0) internal successors, (261), 86 states have internal predecessors, (261), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:33:55,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2175 transitions. [2024-09-25 10:33:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-09-25 10:33:55,138 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:55,139 INFO L216 NwaCegarLoop]: trace histogram [54, 54, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:55,155 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:33:55,342 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 10:33:55,343 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:55,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 756563597, now seen corresponding path program 2 times [2024-09-25 10:33:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:55,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531059442] [2024-09-25 10:33:55,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:55,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:57,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:57,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:33:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531059442] [2024-09-25 10:33:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531059442] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549258318] [2024-09-25 10:33:57,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:33:57,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:57,449 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:33:57,450 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:33:57,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:33:57,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:57,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-25 10:33:57,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:33:59,314 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:34:02,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:34:02,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549258318] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:34:02,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:34:02,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 173 [2024-09-25 10:34:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449127331] [2024-09-25 10:34:02,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:34:02,877 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 173 states [2024-09-25 10:34:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:34:02,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2024-09-25 10:34:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12125, Invalid=17631, Unknown=0, NotChecked=0, Total=29756 [2024-09-25 10:34:02,888 INFO L87 Difference]: Start difference. First operand 1819 states and 2175 transitions. Second operand has 173 states, 173 states have (on average 2.9710982658959537) internal successors, (514), 172 states have internal predecessors, (514), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:34:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:34:23,211 INFO L93 Difference]: Finished difference Result 12026 states and 14700 transitions. [2024-09-25 10:34:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2024-09-25 10:34:23,212 INFO L78 Accepts]: Start accepts. Automaton has has 173 states, 173 states have (on average 2.9710982658959537) internal successors, (514), 172 states have internal predecessors, (514), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 183 [2024-09-25 10:34:23,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:34:23,258 INFO L225 Difference]: With dead ends: 12026 [2024-09-25 10:34:23,259 INFO L226 Difference]: Without dead ends: 10628 [2024-09-25 10:34:23,279 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 447 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67792 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=60774, Invalid=140378, Unknown=0, NotChecked=0, Total=201152 [2024-09-25 10:34:23,280 INFO L434 NwaCegarLoop]: 9 mSDtfsCounter, 2314 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2315 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-25 10:34:23,280 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2315 Valid, 34 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-25 10:34:23,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10628 states. [2024-09-25 10:34:24,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10628 to 4196. [2024-09-25 10:34:24,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4196 states, 4169 states have (on average 1.2165987047253537) internal successors, (5072), 4174 states have internal predecessors, (5072), 16 states have call successors, (16), 11 states have call predecessors, (16), 10 states have return successors, (15), 10 states have call predecessors, (15), 15 states have call successors, (15) [2024-09-25 10:34:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 5103 transitions. [2024-09-25 10:34:24,281 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 5103 transitions. Word has length 183 [2024-09-25 10:34:24,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:34:24,282 INFO L474 AbstractCegarLoop]: Abstraction has 4196 states and 5103 transitions. [2024-09-25 10:34:24,282 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 173 states, 173 states have (on average 2.9710982658959537) internal successors, (514), 172 states have internal predecessors, (514), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-09-25 10:34:24,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:24,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 5103 transitions. [2024-09-25 10:34:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-09-25 10:34:24,289 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:34:24,290 INFO L216 NwaCegarLoop]: trace histogram [108, 108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:34:24,306 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-25 10:34:24,490 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:24,491 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:34:24,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:24,491 INFO L85 PathProgramCache]: Analyzing trace with hash 613596365, now seen corresponding path program 1 times [2024-09-25 10:34:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:34:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017858343] [2024-09-25 10:34:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:34:24,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:34:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:24,735 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:34:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:24,742 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:34:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 17442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17442 trivial. 0 not checked. [2024-09-25 10:34:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:34:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017858343] [2024-09-25 10:34:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017858343] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:34:24,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:34:24,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-25 10:34:24,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025099906] [2024-09-25 10:34:24,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:34:24,751 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-25 10:34:24,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:34:24,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-25 10:34:24,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-25 10:34:24,752 INFO L87 Difference]: Start difference. First operand 4196 states and 5103 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:34:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:34:26,035 INFO L93 Difference]: Finished difference Result 7524 states and 9224 transitions. [2024-09-25 10:34:26,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-25 10:34:26,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 345 [2024-09-25 10:34:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:34:26,060 INFO L225 Difference]: With dead ends: 7524 [2024-09-25 10:34:26,060 INFO L226 Difference]: Without dead ends: 5851 [2024-09-25 10:34:26,064 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:34:26,064 INFO L434 NwaCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:34:26,065 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 30 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:34:26,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5851 states. [2024-09-25 10:34:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5851 to 4871. [2024-09-25 10:34:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4871 states, 4842 states have (on average 1.2327550598926063) internal successors, (5969), 4847 states have internal predecessors, (5969), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (17), 12 states have call predecessors, (17), 17 states have call successors, (17) [2024-09-25 10:34:26,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 6004 transitions. [2024-09-25 10:34:26,963 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 6004 transitions. Word has length 345 [2024-09-25 10:34:26,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:34:26,964 INFO L474 AbstractCegarLoop]: Abstraction has 4871 states and 6004 transitions. [2024-09-25 10:34:26,964 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:34:26,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 6004 transitions. [2024-09-25 10:34:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-09-25 10:34:26,969 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:34:26,970 INFO L216 NwaCegarLoop]: trace histogram [109, 109, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:34:26,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-25 10:34:26,970 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:34:26,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:26,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1256704231, now seen corresponding path program 3 times [2024-09-25 10:34:26,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:34:26,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733515329] [2024-09-25 10:34:26,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:34:26,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:34:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:34,215 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:34:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:34,219 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:34:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 17767 backedges. 0 proven. 17767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:34:34,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:34:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733515329] [2024-09-25 10:34:34,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733515329] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:34:34,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180519545] [2024-09-25 10:34:34,228 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:34:34,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:34,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:34:34,229 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:34,230 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:34,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-25 10:34:34,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:34:34,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-25 10:34:34,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:34:35,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17767 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 17442 trivial. 0 not checked. [2024-09-25 10:34:35,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-25 10:34:35,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180519545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:34:35,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-25 10:34:35,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [115] total 122 [2024-09-25 10:34:35,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577850948] [2024-09-25 10:34:35,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:34:35,287 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:34:35,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:34:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:34:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6133, Invalid=8629, Unknown=0, NotChecked=0, Total=14762 [2024-09-25 10:34:35,289 INFO L87 Difference]: Start difference. First operand 4871 states and 6004 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:34:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:34:36,164 INFO L93 Difference]: Finished difference Result 4882 states and 6015 transitions. [2024-09-25 10:34:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-25 10:34:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 348 [2024-09-25 10:34:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:34:36,186 INFO L225 Difference]: With dead ends: 4882 [2024-09-25 10:34:36,186 INFO L226 Difference]: Without dead ends: 4880 [2024-09-25 10:34:36,189 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6137, Invalid=8869, Unknown=0, NotChecked=0, Total=15006 [2024-09-25 10:34:36,189 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:34:36,190 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 149 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:34:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2024-09-25 10:34:37,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4879. [2024-09-25 10:34:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4879 states, 4848 states have (on average 1.23246699669967) internal successors, (5975), 4854 states have internal predecessors, (5975), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-25 10:34:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 6012 transitions. [2024-09-25 10:34:37,228 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 6012 transitions. Word has length 348 [2024-09-25 10:34:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:34:37,229 INFO L474 AbstractCegarLoop]: Abstraction has 4879 states and 6012 transitions. [2024-09-25 10:34:37,229 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-25 10:34:37,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:37,230 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 6012 transitions. [2024-09-25 10:34:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2024-09-25 10:34:37,252 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:34:37,253 INFO L216 NwaCegarLoop]: trace histogram [216, 216, 216, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:34:37,271 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-25 10:34:37,453 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:37,454 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:34:37,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:34:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash 346650736, now seen corresponding path program 1 times [2024-09-25 10:34:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:34:37,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672682868] [2024-09-25 10:34:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:34:37,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:34:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:45,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:34:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:45,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:34:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:45,692 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-09-25 10:34:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:45,700 INFO L134 CoverageAnalysis]: Checked inductivity of 70101 backedges. 35212 proven. 17442 refuted. 0 times theorem prover too weak. 17447 trivial. 0 not checked. [2024-09-25 10:34:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:34:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672682868] [2024-09-25 10:34:45,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672682868] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:34:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685797163] [2024-09-25 10:34:45,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:34:45,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:34:45,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:34:45,704 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:34:45,706 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:34:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:34:45,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-09-25 10:34:45,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:34:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 70101 backedges. 35210 proven. 17442 refuted. 0 times theorem prover too weak. 17449 trivial. 0 not checked. [2024-09-25 10:34:51,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:35:04,452 INFO L134 CoverageAnalysis]: Checked inductivity of 70101 backedges. 35212 proven. 17442 refuted. 0 times theorem prover too weak. 17447 trivial. 0 not checked. [2024-09-25 10:35:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685797163] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:35:04,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:35:04,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 112, 112] total 332 [2024-09-25 10:35:04,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965532007] [2024-09-25 10:35:04,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:35:04,454 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 332 states [2024-09-25 10:35:04,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:35:04,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 332 interpolants. [2024-09-25 10:35:04,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48405, Invalid=61487, Unknown=0, NotChecked=0, Total=109892 [2024-09-25 10:35:04,473 INFO L87 Difference]: Start difference. First operand 4879 states and 6012 transitions. Second operand has 332 states, 332 states have (on average 3.036144578313253) internal successors, (1008), 331 states have internal predecessors, (1008), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 10:35:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:35:44,600 INFO L93 Difference]: Finished difference Result 61262 states and 67026 transitions. [2024-09-25 10:35:44,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2024-09-25 10:35:44,601 INFO L78 Accepts]: Start accepts. Automaton has has 332 states, 332 states have (on average 3.036144578313253) internal successors, (1008), 331 states have internal predecessors, (1008), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 680 [2024-09-25 10:35:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:35:44,767 INFO L225 Difference]: With dead ends: 61262 [2024-09-25 10:35:44,767 INFO L226 Difference]: Without dead ends: 57210 [2024-09-25 10:35:44,805 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1587 GetRequests, 1147 SyntacticMatches, 0 SemanticMatches, 440 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71936 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=72717, Invalid=122205, Unknown=0, NotChecked=0, Total=194922 [2024-09-25 10:35:44,806 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1843 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-25 10:35:44,806 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 22 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-25 10:35:44,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57210 states. [2024-09-25 10:35:52,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57210 to 11786. [2024-09-25 10:35:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11786 states, 11755 states have (on average 1.1982135261590812) internal successors, (14085), 11761 states have internal predecessors, (14085), 19 states have call successors, (19), 12 states have call predecessors, (19), 11 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2024-09-25 10:35:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11786 states to 11786 states and 14122 transitions. [2024-09-25 10:35:52,975 INFO L78 Accepts]: Start accepts. Automaton has 11786 states and 14122 transitions. Word has length 680 [2024-09-25 10:35:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:35:52,976 INFO L474 AbstractCegarLoop]: Abstraction has 11786 states and 14122 transitions. [2024-09-25 10:35:52,977 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 332 states, 332 states have (on average 3.036144578313253) internal successors, (1008), 331 states have internal predecessors, (1008), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-09-25 10:35:52,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand 11786 states and 14122 transitions. [2024-09-25 10:35:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2024-09-25 10:35:53,002 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:35:53,002 INFO L216 NwaCegarLoop]: trace histogram [436, 436, 436, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:35:53,021 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-25 10:35:53,202 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-25 10:35:53,203 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:35:53,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:35:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 379592880, now seen corresponding path program 2 times [2024-09-25 10:35:53,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:35:53,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136721000] [2024-09-25 10:35:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:35:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:35:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:29,564 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:36:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:29,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-25 10:36:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:29,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-09-25 10:36:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:36:29,581 INFO L134 CoverageAnalysis]: Checked inductivity of 285371 backedges. 143012 proven. 71177 refuted. 0 times theorem prover too weak. 71182 trivial. 0 not checked. [2024-09-25 10:36:29,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:36:29,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136721000] [2024-09-25 10:36:29,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136721000] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:36:29,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259028248] [2024-09-25 10:36:29,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:36:29,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:36:29,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:36:29,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:36:29,585 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:36:29,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:36:29,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:36:29,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 2721 conjuncts, 221 conjuncts are in the unsatisfiable core [2024-09-25 10:36:29,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:36:49,335 INFO L134 CoverageAnalysis]: Checked inductivity of 285371 backedges. 143010 proven. 71177 refuted. 0 times theorem prover too weak. 71184 trivial. 0 not checked. [2024-09-25 10:36:49,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:37:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 285371 backedges. 143012 proven. 71177 refuted. 0 times theorem prover too weak. 71182 trivial. 0 not checked. [2024-09-25 10:37:40,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259028248] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:37:40,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:37:40,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [223, 222, 222] total 662 [2024-09-25 10:37:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291319271] [2024-09-25 10:37:40,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:37:40,119 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 662 states [2024-09-25 10:37:40,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:37:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 662 interpolants. [2024-09-25 10:37:40,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193605, Invalid=243977, Unknown=0, NotChecked=0, Total=437582 [2024-09-25 10:37:40,175 INFO L87 Difference]: Start difference. First operand 11786 states and 14122 transitions. Second operand has 662 states, 662 states have (on average 3.0181268882175227) internal successors, (1998), 661 states have internal predecessors, (1998), 4 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7)