./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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6908dde5 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/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 --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-6908dde-m [2024-09-24 23:14:30,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-24 23:14:30,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-24 23:14:30,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-24 23:14:30,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-24 23:14:30,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-24 23:14:30,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-24 23:14:30,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-24 23:14:30,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-24 23:14:30,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-24 23:14:30,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-24 23:14:30,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-24 23:14:30,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-24 23:14:30,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-24 23:14:30,167 INFO L153 SettingsManager]: * Use SBE=true [2024-09-24 23:14:30,168 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-24 23:14:30,168 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-24 23:14:30,168 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-24 23:14:30,168 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-24 23:14:30,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-24 23:14:30,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-24 23:14:30,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-24 23:14:30,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-24 23:14:30,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-24 23:14:30,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-24 23:14:30,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-24 23:14:30,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-24 23:14:30,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-24 23:14:30,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-24 23:14:30,172 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-24 23:14:30,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-24 23:14:30,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-24 23:14:30,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:14:30,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-24 23:14:30,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-24 23:14:30,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-24 23:14:30,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-24 23:14:30,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-24 23:14:30,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-24 23:14:30,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-24 23:14:30,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-24 23:14:30,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-24 23:14:30,175 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.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-24 23:14:30,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-24 23:14:30,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-24 23:14:30,440 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-24 23:14:30,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-24 23:14:30,441 INFO L274 PluginConnector]: CDTParser initialized [2024-09-24 23:14:30,442 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-24 23:14:31,822 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-24 23:14:31,993 INFO L384 CDTParser]: Found 1 translation units. [2024-09-24 23:14:31,993 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/nested_delay_nd.c [2024-09-24 23:14:32,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/0513b9384/a6034d9d7b14408e9cc153b4999ad713/FLAGcd1067037 [2024-09-24 23:14:32,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/0513b9384/a6034d9d7b14408e9cc153b4999ad713 [2024-09-24 23:14:32,016 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-24 23:14:32,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-24 23:14:32,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-24 23:14:32,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-24 23:14:32,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-24 23:14:32,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73cf3cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32, skipping insertion in model container [2024-09-24 23:14:32,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-24 23:14:32,176 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-24 23:14:32,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:14:32,199 INFO L200 MainTranslator]: Completed pre-run [2024-09-24 23:14:32,215 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-24 23:14:32,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-24 23:14:32,238 INFO L204 MainTranslator]: Completed translation [2024-09-24 23:14:32,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32 WrapperNode [2024-09-24 23:14:32,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-24 23:14:32,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-24 23:14:32,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-24 23:14:32,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-24 23:14:32,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,260 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-24 23:14:32,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-24 23:14:32,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-24 23:14:32,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-24 23:14:32,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-24 23:14:32,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,292 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-24 23:14:32,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,299 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-24 23:14:32,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-24 23:14:32,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-24 23:14:32,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-24 23:14:32,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (1/1) ... [2024-09-24 23:14:32,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-24 23:14:32,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:32,335 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-24 23:14:32,337 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-24 23:14:32,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-24 23:14:32,382 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-24 23:14:32,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-24 23:14:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-24 23:14:32,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-24 23:14:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-24 23:14:32,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-24 23:14:32,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-24 23:14:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-24 23:14:32,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-24 23:14:32,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-24 23:14:32,386 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-24 23:14:32,455 INFO L241 CfgBuilder]: Building ICFG [2024-09-24 23:14:32,457 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-24 23:14:32,643 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-09-24 23:14:32,644 INFO L290 CfgBuilder]: Performing block encoding [2024-09-24 23:14:32,674 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-24 23:14:32,675 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-24 23:14:32,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:14:32 BoogieIcfgContainer [2024-09-24 23:14:32,676 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-24 23:14:32,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-24 23:14:32,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-24 23:14:32,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-24 23:14:32,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 11:14:32" (1/3) ... [2024-09-24 23:14:32,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525742d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:14:32, skipping insertion in model container [2024-09-24 23:14:32,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 11:14:32" (2/3) ... [2024-09-24 23:14:32,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525742d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 11:14:32, skipping insertion in model container [2024-09-24 23:14:32,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 11:14:32" (3/3) ... [2024-09-24 23:14:32,686 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_delay_nd.c [2024-09-24 23:14:32,702 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-24 23:14:32,702 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-24 23:14:32,763 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-24 23:14:32,769 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;@29e0989b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-24 23:14:32,770 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-24 23:14:32,774 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-24 23:14:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-24 23:14:32,780 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:32,781 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-24 23:14:32,782 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:32,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:32,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1899367790, now seen corresponding path program 1 times [2024-09-24 23:14:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:32,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438647309] [2024-09-24 23:14:32,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:32,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:32,999 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,028 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-24 23:14:33,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:33,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438647309] [2024-09-24 23:14:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438647309] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:14:33,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:14:33,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-24 23:14:33,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554679500] [2024-09-24 23:14:33,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:14:33,039 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-24 23:14:33,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:33,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-24 23:14:33,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-24 23:14:33,066 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-24 23:14:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:33,170 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. [2024-09-24 23:14:33,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-24 23:14:33,173 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-24 23:14:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:33,179 INFO L225 Difference]: With dead ends: 48 [2024-09-24 23:14:33,180 INFO L226 Difference]: Without dead ends: 26 [2024-09-24 23:14:33,183 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-24 23:14:33,190 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-24 23:14:33,193 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-24 23:14:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-09-24 23:14:33,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-09-24 23:14:33,255 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-24 23:14:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-09-24 23:14:33,263 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 20 [2024-09-24 23:14:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:33,264 INFO L474 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-09-24 23:14:33,267 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-24 23:14:33,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-09-24 23:14:33,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-24 23:14:33,269 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:33,269 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-24 23:14:33,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-24 23:14:33,271 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:33,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -678482725, now seen corresponding path program 1 times [2024-09-24 23:14:33,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:33,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306527017] [2024-09-24 23:14:33,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,446 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:33,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,470 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,478 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-24 23:14:33,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306527017] [2024-09-24 23:14:33,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306527017] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:14:33,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:14:33,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-24 23:14:33,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321770450] [2024-09-24 23:14:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:14:33,481 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-24 23:14:33,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:33,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-24 23:14:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-24 23:14:33,482 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-24 23:14:33,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:33,568 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-09-24 23:14:33,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:14:33,569 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-24 23:14:33,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:33,570 INFO L225 Difference]: With dead ends: 44 [2024-09-24 23:14:33,570 INFO L226 Difference]: Without dead ends: 29 [2024-09-24 23:14:33,570 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-24 23:14:33,572 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-24 23:14:33,572 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-24 23:14:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-24 23:14:33,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-09-24 23:14:33,580 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-24 23:14:33,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-09-24 23:14:33,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 20 [2024-09-24 23:14:33,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:33,584 INFO L474 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-09-24 23:14:33,584 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-24 23:14:33,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-09-24 23:14:33,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-24 23:14:33,586 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:33,587 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-24 23:14:33,587 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-24 23:14:33,587 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:33,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2109323453, now seen corresponding path program 1 times [2024-09-24 23:14:33,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156879756] [2024-09-24 23:14:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,660 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,669 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,677 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-24 23:14:33,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:33,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156879756] [2024-09-24 23:14:33,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156879756] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:14:33,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:14:33,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 23:14:33,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438378646] [2024-09-24 23:14:33,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:14:33,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 23:14:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:33,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 23:14:33,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 23:14:33,680 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-24 23:14:33,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:33,763 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-09-24 23:14:33,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 23:14:33,763 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-24 23:14:33,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:33,765 INFO L225 Difference]: With dead ends: 48 [2024-09-24 23:14:33,765 INFO L226 Difference]: Without dead ends: 32 [2024-09-24 23:14:33,765 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-24 23:14:33,767 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-24 23:14:33,767 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-24 23:14:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-09-24 23:14:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-09-24 23:14:33,785 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-24 23:14:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-09-24 23:14:33,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2024-09-24 23:14:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:33,787 INFO L474 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-09-24 23:14:33,787 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-24 23:14:33,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-09-24 23:14:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-24 23:14:33,788 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:33,788 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-24 23:14:33,788 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-24 23:14:33,789 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:33,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash -334316091, now seen corresponding path program 1 times [2024-09-24 23:14:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:33,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449561431] [2024-09-24 23:14:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,874 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,902 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-24 23:14:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449561431] [2024-09-24 23:14:33,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449561431] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:14:33,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033664492] [2024-09-24 23:14:33,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:14:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:33,906 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-24 23:14:33,908 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-24 23:14:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:33,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-24 23:14:33,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:14:34,087 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-24 23:14:34,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:14:34,155 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-24 23:14:34,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033664492] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:14:34,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:14:34,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-09-24 23:14:34,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408662336] [2024-09-24 23:14:34,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:14:34,157 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-24 23:14:34,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:34,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-24 23:14:34,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-09-24 23:14:34,158 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-24 23:14:34,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:34,321 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2024-09-24 23:14:34,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 23:14:34,322 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-24 23:14:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:34,323 INFO L225 Difference]: With dead ends: 54 [2024-09-24 23:14:34,323 INFO L226 Difference]: Without dead ends: 37 [2024-09-24 23:14:34,323 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-24 23:14:34,324 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-24 23:14:34,325 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-24 23:14:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-09-24 23:14:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-09-24 23:14:34,339 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-24 23:14:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-09-24 23:14:34,340 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 23 [2024-09-24 23:14:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:34,341 INFO L474 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-09-24 23:14:34,341 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-24 23:14:34,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-09-24 23:14:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-24 23:14:34,342 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:34,342 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-24 23:14:34,382 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-24 23:14:34,543 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-24 23:14:34,544 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:34,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash -914591395, now seen corresponding path program 2 times [2024-09-24 23:14:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:34,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616662242] [2024-09-24 23:14:34,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:34,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:34,685 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:34,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:34,704 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-24 23:14:34,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616662242] [2024-09-24 23:14:34,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616662242] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:14:34,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616962428] [2024-09-24 23:14:34,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:14:34,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:14:34,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:34,709 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-24 23:14:34,720 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-24 23:14:34,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:14:34,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:14:34,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-24 23:14:34,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:14:34,849 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-24 23:14:34,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:14:34,922 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-24 23:14:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616962428] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:14:34,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:14:34,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2024-09-24 23:14:34,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178925582] [2024-09-24 23:14:34,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:14:34,927 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-24 23:14:34,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:34,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-24 23:14:34,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-09-24 23:14:34,928 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-24 23:14:35,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:35,876 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2024-09-24 23:14:35,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-09-24 23:14:35,877 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-24 23:14:35,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:35,880 INFO L225 Difference]: With dead ends: 178 [2024-09-24 23:14:35,882 INFO L226 Difference]: Without dead ends: 152 [2024-09-24 23:14:35,884 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-24 23:14:35,885 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-24 23:14:35,887 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-24 23:14:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-09-24 23:14:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 113. [2024-09-24 23:14:35,932 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-24 23:14:35,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2024-09-24 23:14:35,935 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 32 [2024-09-24 23:14:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:35,936 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2024-09-24 23:14:35,936 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-24 23:14:35,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:35,937 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2024-09-24 23:14:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-24 23:14:35,939 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:35,939 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-24 23:14:35,956 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-24 23:14:36,142 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-24 23:14:36,143 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:36,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:36,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2125730691, now seen corresponding path program 1 times [2024-09-24 23:14:36,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:36,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568361087] [2024-09-24 23:14:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:36,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,203 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,206 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-24 23:14:36,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:36,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568361087] [2024-09-24 23:14:36,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568361087] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:14:36,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:14:36,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 23:14:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297791736] [2024-09-24 23:14:36,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:14:36,207 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 23:14:36,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 23:14:36,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 23:14:36,208 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-24 23:14:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:36,287 INFO L93 Difference]: Finished difference Result 222 states and 296 transitions. [2024-09-24 23:14:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 23:14:36,288 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-24 23:14:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:36,289 INFO L225 Difference]: With dead ends: 222 [2024-09-24 23:14:36,289 INFO L226 Difference]: Without dead ends: 120 [2024-09-24 23:14:36,290 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-24 23:14:36,290 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-24 23:14:36,291 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-24 23:14:36,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-09-24 23:14:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 83. [2024-09-24 23:14:36,309 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-24 23:14:36,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 104 transitions. [2024-09-24 23:14:36,310 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 104 transitions. Word has length 35 [2024-09-24 23:14:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:36,311 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 104 transitions. [2024-09-24 23:14:36,311 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-24 23:14:36,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:36,312 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 104 transitions. [2024-09-24 23:14:36,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-24 23:14:36,312 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:36,313 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-24 23:14:36,313 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-24 23:14:36,313 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:36,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1071915545, now seen corresponding path program 1 times [2024-09-24 23:14:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718066580] [2024-09-24 23:14:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,376 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,382 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-24 23:14:36,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:36,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718066580] [2024-09-24 23:14:36,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718066580] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:14:36,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:14:36,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-24 23:14:36,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351566253] [2024-09-24 23:14:36,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:14:36,386 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-24 23:14:36,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:36,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-24 23:14:36,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-24 23:14:36,387 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-24 23:14:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:36,444 INFO L93 Difference]: Finished difference Result 160 states and 204 transitions. [2024-09-24 23:14:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-24 23:14:36,444 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-24 23:14:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:36,445 INFO L225 Difference]: With dead ends: 160 [2024-09-24 23:14:36,446 INFO L226 Difference]: Without dead ends: 88 [2024-09-24 23:14:36,446 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-24 23:14:36,447 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-24 23:14:36,447 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-24 23:14:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-09-24 23:14:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-09-24 23:14:36,477 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-24 23:14:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2024-09-24 23:14:36,478 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 36 [2024-09-24 23:14:36,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:36,478 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2024-09-24 23:14:36,478 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-24 23:14:36,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:36,479 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2024-09-24 23:14:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-24 23:14:36,480 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:36,480 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-24 23:14:36,480 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-24 23:14:36,480 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:36,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:36,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1014657243, now seen corresponding path program 1 times [2024-09-24 23:14:36,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:36,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123072427] [2024-09-24 23:14:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:36,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,618 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,625 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-24 23:14:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123072427] [2024-09-24 23:14:36,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123072427] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:14:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323734983] [2024-09-24 23:14:36,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:36,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:14:36,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:36,627 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-24 23:14:36,630 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-24 23:14:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:36,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-09-24 23:14:36,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:14:36,820 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-24 23:14:36,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:14:36,947 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-24 23:14:36,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323734983] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:14:36,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:14:36,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2024-09-24 23:14:36,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536916933] [2024-09-24 23:14:36,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:14:36,948 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-24 23:14:36,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-24 23:14:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=305, Unknown=0, NotChecked=0, Total=506 [2024-09-24 23:14:36,949 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-24 23:14:37,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:37,191 INFO L93 Difference]: Finished difference Result 239 states and 321 transitions. [2024-09-24 23:14:37,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-24 23:14:37,192 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-24 23:14:37,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:37,194 INFO L225 Difference]: With dead ends: 239 [2024-09-24 23:14:37,194 INFO L226 Difference]: Without dead ends: 162 [2024-09-24 23:14:37,195 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-24 23:14:37,197 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-24 23:14:37,198 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-24 23:14:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-09-24 23:14:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 150. [2024-09-24 23:14:37,244 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-24 23:14:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 184 transitions. [2024-09-24 23:14:37,245 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 184 transitions. Word has length 36 [2024-09-24 23:14:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:37,245 INFO L474 AbstractCegarLoop]: Abstraction has 150 states and 184 transitions. [2024-09-24 23:14:37,246 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-24 23:14:37,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2024-09-24 23:14:37,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-24 23:14:37,248 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:37,248 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-24 23:14:37,265 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-09-24 23:14:37,451 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-24 23:14:37,452 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:37,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:37,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1524013939, now seen corresponding path program 2 times [2024-09-24 23:14:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614191164] [2024-09-24 23:14:37,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:37,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:37,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:37,725 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-24 23:14:37,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:37,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614191164] [2024-09-24 23:14:37,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614191164] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:14:37,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537296589] [2024-09-24 23:14:37,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:14:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:14:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:37,727 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-24 23:14:37,729 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-24 23:14:37,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:14:37,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:14:37,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-24 23:14:37,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:14:38,073 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-24 23:14:38,074 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:14:38,435 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-24 23:14:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537296589] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:14:38,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:14:38,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2024-09-24 23:14:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369478486] [2024-09-24 23:14:38,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:14:38,437 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-24 23:14:38,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:38,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-24 23:14:38,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=789, Invalid=1103, Unknown=0, NotChecked=0, Total=1892 [2024-09-24 23:14:38,445 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-24 23:14:38,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:38,975 INFO L93 Difference]: Finished difference Result 443 states and 595 transitions. [2024-09-24 23:14:38,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-09-24 23:14:38,976 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-24 23:14:38,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:38,978 INFO L225 Difference]: With dead ends: 443 [2024-09-24 23:14:38,978 INFO L226 Difference]: Without dead ends: 304 [2024-09-24 23:14:38,980 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-24 23:14:38,981 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-24 23:14:38,981 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-24 23:14:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-09-24 23:14:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 276. [2024-09-24 23:14:39,025 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-24 23:14:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 338 transitions. [2024-09-24 23:14:39,027 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 338 transitions. Word has length 57 [2024-09-24 23:14:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:39,027 INFO L474 AbstractCegarLoop]: Abstraction has 276 states and 338 transitions. [2024-09-24 23:14:39,028 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-24 23:14:39,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 338 transitions. [2024-09-24 23:14:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-09-24 23:14:39,029 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:39,030 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-24 23:14:39,049 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-24 23:14:39,234 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-24 23:14:39,235 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:39,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:39,235 INFO L85 PathProgramCache]: Analyzing trace with hash -610331763, now seen corresponding path program 3 times [2024-09-24 23:14:39,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:39,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442017985] [2024-09-24 23:14:39,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:39,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:39,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:39,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:39,999 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-24 23:14:39,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442017985] [2024-09-24 23:14:39,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442017985] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:14:39,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984250253] [2024-09-24 23:14:39,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 23:14:40,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:14:40,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:40,001 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-24 23:14:40,003 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-24 23:14:40,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-24 23:14:40,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:14:40,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-24 23:14:40,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:14:40,452 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-24 23:14:40,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:14:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984250253] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:14:40,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:14:40,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [31] total 38 [2024-09-24 23:14:40,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554572632] [2024-09-24 23:14:40,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:14:40,453 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 23:14:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 23:14:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=976, Unknown=0, NotChecked=0, Total=1406 [2024-09-24 23:14:40,454 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-24 23:14:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:40,624 INFO L93 Difference]: Finished difference Result 460 states and 556 transitions. [2024-09-24 23:14:40,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 23:14:40,625 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-24 23:14:40,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:40,628 INFO L225 Difference]: With dead ends: 460 [2024-09-24 23:14:40,628 INFO L226 Difference]: Without dead ends: 458 [2024-09-24 23:14:40,629 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=434, Invalid=1048, Unknown=0, NotChecked=0, Total=1482 [2024-09-24 23:14:40,629 INFO L434 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-24 23:14:40,629 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-24 23:14:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-09-24 23:14:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2024-09-24 23:14:40,703 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-24 23:14:40,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 551 transitions. [2024-09-24 23:14:40,706 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 551 transitions. Word has length 99 [2024-09-24 23:14:40,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:40,707 INFO L474 AbstractCegarLoop]: Abstraction has 456 states and 551 transitions. [2024-09-24 23:14:40,707 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-24 23:14:40,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 551 transitions. [2024-09-24 23:14:40,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-09-24 23:14:40,713 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:40,713 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-24 23:14:40,729 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-24 23:14:40,913 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-24 23:14:40,914 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:40,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:40,915 INFO L85 PathProgramCache]: Analyzing trace with hash -612178805, now seen corresponding path program 1 times [2024-09-24 23:14:40,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:40,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639696850] [2024-09-24 23:14:40,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:41,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:41,089 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:41,093 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-24 23:14:41,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:41,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639696850] [2024-09-24 23:14:41,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639696850] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:14:41,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:14:41,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:14:41,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352226271] [2024-09-24 23:14:41,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:14:41,096 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:14:41,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:41,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:14:41,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:14:41,097 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-24 23:14:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:41,292 INFO L93 Difference]: Finished difference Result 978 states and 1200 transitions. [2024-09-24 23:14:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-24 23:14:41,293 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-24 23:14:41,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:41,298 INFO L225 Difference]: With dead ends: 978 [2024-09-24 23:14:41,298 INFO L226 Difference]: Without dead ends: 713 [2024-09-24 23:14:41,299 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-24 23:14:41,299 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-24 23:14:41,300 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-24 23:14:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-09-24 23:14:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2024-09-24 23:14:41,433 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-24 23:14:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 869 transitions. [2024-09-24 23:14:41,436 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 869 transitions. Word has length 99 [2024-09-24 23:14:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:41,437 INFO L474 AbstractCegarLoop]: Abstraction has 713 states and 869 transitions. [2024-09-24 23:14:41,437 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-24 23:14:41,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 869 transitions. [2024-09-24 23:14:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-09-24 23:14:41,441 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:41,441 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-24 23:14:41,441 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-24 23:14:41,441 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:41,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 119150093, now seen corresponding path program 1 times [2024-09-24 23:14:41,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:41,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167969267] [2024-09-24 23:14:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:41,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:42,125 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:42,132 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:42,136 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-24 23:14:42,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:42,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167969267] [2024-09-24 23:14:42,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167969267] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:14:42,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402320596] [2024-09-24 23:14:42,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:42,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:14:42,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:42,139 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-24 23:14:42,140 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-24 23:14:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:42,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-09-24 23:14:42,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:14:42,954 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-24 23:14:42,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:14:44,050 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-24 23:14:44,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402320596] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:14:44,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:14:44,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 87 [2024-09-24 23:14:44,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263301817] [2024-09-24 23:14:44,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:14:44,052 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-09-24 23:14:44,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:44,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-09-24 23:14:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3063, Invalid=4419, Unknown=0, NotChecked=0, Total=7482 [2024-09-24 23:14:44,057 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-24 23:14:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:14:47,438 INFO L93 Difference]: Finished difference Result 2542 states and 3418 transitions. [2024-09-24 23:14:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2024-09-24 23:14:47,439 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-24 23:14:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:14:47,449 INFO L225 Difference]: With dead ends: 2542 [2024-09-24 23:14:47,449 INFO L226 Difference]: Without dead ends: 1999 [2024-09-24 23:14:47,458 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10338 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=9966, Invalid=21186, Unknown=0, NotChecked=0, Total=31152 [2024-09-24 23:14:47,459 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-24 23:14:47,459 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-24 23:14:47,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2024-09-24 23:14:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1819. [2024-09-24 23:14:47,814 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-24 23:14:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2175 transitions. [2024-09-24 23:14:47,823 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2175 transitions. Word has length 99 [2024-09-24 23:14:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:14:47,824 INFO L474 AbstractCegarLoop]: Abstraction has 1819 states and 2175 transitions. [2024-09-24 23:14:47,824 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-24 23:14:47,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2175 transitions. [2024-09-24 23:14:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-09-24 23:14:47,827 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:14:47,828 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-24 23:14:47,842 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-24 23:14:48,032 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-24 23:14:48,033 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:14:48,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:14:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash 756563597, now seen corresponding path program 2 times [2024-09-24 23:14:48,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:14:48,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218144910] [2024-09-24 23:14:48,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:14:48,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:14:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:50,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:14:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:50,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:14:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:14:50,063 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-24 23:14:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:14:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218144910] [2024-09-24 23:14:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218144910] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:14:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112114274] [2024-09-24 23:14:50,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:14:50,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:14:50,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:14:50,066 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-24 23:14:50,068 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-24 23:14:50,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:14:50,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:14:50,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-09-24 23:14:50,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:14:51,878 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-24 23:14:51,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:14:55,401 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-24 23:14:55,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112114274] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:14:55,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:14:55,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 173 [2024-09-24 23:14:55,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797568692] [2024-09-24 23:14:55,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:14:55,403 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 173 states [2024-09-24 23:14:55,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:14:55,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2024-09-24 23:14:55,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12125, Invalid=17631, Unknown=0, NotChecked=0, Total=29756 [2024-09-24 23:14:55,437 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-24 23:15:15,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:15:15,152 INFO L93 Difference]: Finished difference Result 12026 states and 14700 transitions. [2024-09-24 23:15:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 335 states. [2024-09-24 23:15:15,153 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-24 23:15:15,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:15:15,194 INFO L225 Difference]: With dead ends: 12026 [2024-09-24 23:15:15,194 INFO L226 Difference]: Without dead ends: 10628 [2024-09-24 23:15:15,211 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 447 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67792 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=60774, Invalid=140378, Unknown=0, NotChecked=0, Total=201152 [2024-09-24 23:15:15,212 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.7s IncrementalHoareTripleChecker+Time [2024-09-24 23:15:15,212 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.7s Time] [2024-09-24 23:15:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10628 states. [2024-09-24 23:15:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10628 to 4196. [2024-09-24 23:15:16,052 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-24 23:15:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4196 states to 4196 states and 5103 transitions. [2024-09-24 23:15:16,075 INFO L78 Accepts]: Start accepts. Automaton has 4196 states and 5103 transitions. Word has length 183 [2024-09-24 23:15:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:15:16,076 INFO L474 AbstractCegarLoop]: Abstraction has 4196 states and 5103 transitions. [2024-09-24 23:15:16,077 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-24 23:15:16,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:15:16,077 INFO L276 IsEmpty]: Start isEmpty. Operand 4196 states and 5103 transitions. [2024-09-24 23:15:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-09-24 23:15:16,082 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:15:16,082 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-24 23:15:16,096 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-24 23:15:16,282 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-24 23:15:16,283 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:15:16,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:15:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash 613596365, now seen corresponding path program 1 times [2024-09-24 23:15:16,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:15:16,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321181191] [2024-09-24 23:15:16,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:15:16,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:15:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:16,568 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:15:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:16,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:15:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:16,587 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-24 23:15:16,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:15:16,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321181191] [2024-09-24 23:15:16,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321181191] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:15:16,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-24 23:15:16,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-24 23:15:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494223699] [2024-09-24 23:15:16,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:15:16,588 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-24 23:15:16,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:15:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-24 23:15:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-24 23:15:16,589 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-24 23:15:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:15:17,913 INFO L93 Difference]: Finished difference Result 7524 states and 9224 transitions. [2024-09-24 23:15:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-24 23:15:17,913 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-24 23:15:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:15:17,938 INFO L225 Difference]: With dead ends: 7524 [2024-09-24 23:15:17,938 INFO L226 Difference]: Without dead ends: 5851 [2024-09-24 23:15:17,943 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-24 23:15:17,944 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-24 23:15:17,944 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-24 23:15:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5851 states. [2024-09-24 23:15:19,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5851 to 4871. [2024-09-24 23:15:19,084 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-24 23:15:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 6004 transitions. [2024-09-24 23:15:19,100 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 6004 transitions. Word has length 345 [2024-09-24 23:15:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:15:19,100 INFO L474 AbstractCegarLoop]: Abstraction has 4871 states and 6004 transitions. [2024-09-24 23:15:19,101 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-24 23:15:19,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:15:19,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 6004 transitions. [2024-09-24 23:15:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-09-24 23:15:19,105 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:15:19,106 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-24 23:15:19,106 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-24 23:15:19,106 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:15:19,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:15:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1256704231, now seen corresponding path program 3 times [2024-09-24 23:15:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:15:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945796926] [2024-09-24 23:15:19,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:15:19,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:15:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:26,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:15:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:26,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:15:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:26,093 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-24 23:15:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:15:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945796926] [2024-09-24 23:15:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945796926] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:15:26,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785676037] [2024-09-24 23:15:26,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-24 23:15:26,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:15:26,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:15:26,095 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-24 23:15:26,096 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-24 23:15:26,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-24 23:15:26,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:15:26,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-24 23:15:26,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:15:27,288 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-24 23:15:27,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-24 23:15:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785676037] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-24 23:15:27,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-24 23:15:27,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [115] total 122 [2024-09-24 23:15:27,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168258797] [2024-09-24 23:15:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-24 23:15:27,290 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-24 23:15:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:15:27,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-24 23:15:27,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6133, Invalid=8629, Unknown=0, NotChecked=0, Total=14762 [2024-09-24 23:15:27,294 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-24 23:15:28,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:15:28,391 INFO L93 Difference]: Finished difference Result 4882 states and 6015 transitions. [2024-09-24 23:15:28,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-24 23:15:28,392 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-24 23:15:28,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:15:28,413 INFO L225 Difference]: With dead ends: 4882 [2024-09-24 23:15:28,413 INFO L226 Difference]: Without dead ends: 4880 [2024-09-24 23:15:28,416 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6137, Invalid=8869, Unknown=0, NotChecked=0, Total=15006 [2024-09-24 23:15:28,416 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-24 23:15:28,417 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-24 23:15:28,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2024-09-24 23:15:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4879. [2024-09-24 23:15:29,347 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-24 23:15:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4879 states to 4879 states and 6012 transitions. [2024-09-24 23:15:29,359 INFO L78 Accepts]: Start accepts. Automaton has 4879 states and 6012 transitions. Word has length 348 [2024-09-24 23:15:29,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:15:29,360 INFO L474 AbstractCegarLoop]: Abstraction has 4879 states and 6012 transitions. [2024-09-24 23:15:29,360 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-24 23:15:29,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:15:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 4879 states and 6012 transitions. [2024-09-24 23:15:29,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 681 [2024-09-24 23:15:29,380 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:15:29,381 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-24 23:15:29,397 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-24 23:15:29,581 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-24 23:15:29,582 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:15:29,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:15:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash 346650736, now seen corresponding path program 1 times [2024-09-24 23:15:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:15:29,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372712570] [2024-09-24 23:15:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:15:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:15:29,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:38,338 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:15:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:38,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:15:38,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:38,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2024-09-24 23:15:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:38,352 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-24 23:15:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:15:38,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372712570] [2024-09-24 23:15:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372712570] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:15:38,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853569057] [2024-09-24 23:15:38,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:15:38,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:15:38,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:15:38,358 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-24 23:15:38,359 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-24 23:15:38,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:15:38,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 1401 conjuncts, 111 conjuncts are in the unsatisfiable core [2024-09-24 23:15:38,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:15:43,979 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-24 23:15:43,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:15:56,879 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-24 23:15:56,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853569057] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:15:56,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:15:56,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 112, 112] total 332 [2024-09-24 23:15:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606971874] [2024-09-24 23:15:56,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:15:56,882 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 332 states [2024-09-24 23:15:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:15:56,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 332 interpolants. [2024-09-24 23:15:56,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48405, Invalid=61487, Unknown=0, NotChecked=0, Total=109892 [2024-09-24 23:15:56,912 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-24 23:16:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-24 23:16:35,102 INFO L93 Difference]: Finished difference Result 61262 states and 67026 transitions. [2024-09-24 23:16:35,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2024-09-24 23:16:35,103 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-24 23:16:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-24 23:16:35,263 INFO L225 Difference]: With dead ends: 61262 [2024-09-24 23:16:35,263 INFO L226 Difference]: Without dead ends: 57210 [2024-09-24 23:16:35,295 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-24 23:16:35,296 INFO L434 NwaCegarLoop]: 10 mSDtfsCounter, 1843 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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-24 23:16:35,296 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-24 23:16:35,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57210 states. [2024-09-24 23:16:42,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57210 to 11786. [2024-09-24 23:16:42,430 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-24 23:16:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11786 states to 11786 states and 14122 transitions. [2024-09-24 23:16:42,486 INFO L78 Accepts]: Start accepts. Automaton has 11786 states and 14122 transitions. Word has length 680 [2024-09-24 23:16:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-24 23:16:42,487 INFO L474 AbstractCegarLoop]: Abstraction has 11786 states and 14122 transitions. [2024-09-24 23:16:42,487 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-24 23:16:42,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:16:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 11786 states and 14122 transitions. [2024-09-24 23:16:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2024-09-24 23:16:42,513 INFO L208 NwaCegarLoop]: Found error trace [2024-09-24 23:16:42,513 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-24 23:16:42,533 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-24 23:16:42,714 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-24 23:16:42,714 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-24 23:16:42,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-24 23:16:42,715 INFO L85 PathProgramCache]: Analyzing trace with hash 379592880, now seen corresponding path program 2 times [2024-09-24 23:16:42,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-24 23:16:42,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374159371] [2024-09-24 23:16:42,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-24 23:16:42,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-24 23:16:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:17:17,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-24 23:17:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:17:17,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-24 23:17:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:17:17,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-09-24 23:17:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-24 23:17:17,823 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-24 23:17:17,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-24 23:17:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374159371] [2024-09-24 23:17:17,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374159371] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-24 23:17:17,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853025246] [2024-09-24 23:17:17,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-24 23:17:17,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-24 23:17:17,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-24 23:17:17,825 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-24 23:17:17,826 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-24 23:17:18,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-24 23:17:18,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-24 23:17:18,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 2721 conjuncts, 221 conjuncts are in the unsatisfiable core [2024-09-24 23:17:18,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-24 23:17:37,536 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-24 23:17:37,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-24 23:18:28,677 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-24 23:18:28,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853025246] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-24 23:18:28,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-24 23:18:28,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [223, 222, 222] total 662 [2024-09-24 23:18:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371330651] [2024-09-24 23:18:28,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-24 23:18:28,680 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 662 states [2024-09-24 23:18:28,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-24 23:18:28,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 662 interpolants. [2024-09-24 23:18:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193605, Invalid=243977, Unknown=0, NotChecked=0, Total=437582 [2024-09-24 23:18:28,738 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)