./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_14.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fb1cb0b9 Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops-crafted-1/mono-crafted_14.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 538775af36be57be36a6cd470d0ff7a3d7714753249a7d4cb9a7b907cdacda78 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --traceabstraction.encode.modifies.clause.in.ensures.clause.of.contracts true --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-fb1cb0b-m [2024-09-25 10:31:22,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-25 10:31:22,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-25 10:31:22,171 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-25 10:31:22,171 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-25 10:31:22,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-25 10:31:22,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-25 10:31:22,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-25 10:31:22,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-25 10:31:22,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-25 10:31:22,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-25 10:31:22,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-25 10:31:22,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-25 10:31:22,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-25 10:31:22,214 INFO L153 SettingsManager]: * Use SBE=true [2024-09-25 10:31:22,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-25 10:31:22,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-25 10:31:22,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-25 10:31:22,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-25 10:31:22,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-25 10:31:22,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-25 10:31:22,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-25 10:31:22,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-25 10:31:22,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-25 10:31:22,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-25 10:31:22,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-25 10:31:22,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-25 10:31:22,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-25 10:31:22,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-25 10:31:22,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-25 10:31:22,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-25 10:31:22,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-25 10:31:22,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:22,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-25 10:31:22,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-25 10:31:22,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-25 10:31:22,225 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-25 10:31:22,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-25 10:31:22,226 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-25 10:31:22,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-25 10:31:22,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-25 10:31:22,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-25 10:31:22,227 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 -> 538775af36be57be36a6cd470d0ff7a3d7714753249a7d4cb9a7b907cdacda78 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Encode 'modifies' clause in 'ensures' clause of contracts -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-25 10:31:22,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-25 10:31:22,581 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-25 10:31:22,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-25 10:31:22,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-25 10:31:22,586 INFO L274 PluginConnector]: CDTParser initialized [2024-09-25 10:31:22,587 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops-crafted-1/mono-crafted_14.c [2024-09-25 10:31:24,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-25 10:31:24,318 INFO L384 CDTParser]: Found 1 translation units. [2024-09-25 10:31:24,318 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops-crafted-1/mono-crafted_14.c [2024-09-25 10:31:24,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/8eac65b65/69d4a3c35dbb4629a2b1f5ef4b93bae8/FLAG3e1832a8d [2024-09-25 10:31:24,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/8eac65b65/69d4a3c35dbb4629a2b1f5ef4b93bae8 [2024-09-25 10:31:24,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-25 10:31:24,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-25 10:31:24,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:24,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-25 10:31:24,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-25 10:31:24,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d047691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24, skipping insertion in model container [2024-09-25 10:31:24,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-25 10:31:24,879 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/mono-crafted_14.c[319,332] [2024-09-25 10:31:24,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:24,908 INFO L200 MainTranslator]: Completed pre-run [2024-09-25 10:31:24,919 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/mono-crafted_14.c[319,332] [2024-09-25 10:31:24,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-25 10:31:24,947 INFO L204 MainTranslator]: Completed translation [2024-09-25 10:31:24,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24 WrapperNode [2024-09-25 10:31:24,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-25 10:31:24,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:24,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-25 10:31:24,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-25 10:31:24,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,968 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-25 10:31:24,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-25 10:31:24,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-25 10:31:24,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-25 10:31:24,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-25 10:31:24,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-09-25 10:31:24,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:24,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:25,000 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:25,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:25,005 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:25,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:25,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-25 10:31:25,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-25 10:31:25,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-25 10:31:25,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-25 10:31:25,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (1/1) ... [2024-09-25 10:31:25,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-25 10:31:25,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:25,044 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-25 10:31:25,047 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-25 10:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-25 10:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-25 10:31:25,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-25 10:31:25,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-25 10:31:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-25 10:31:25,095 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-25 10:31:25,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-25 10:31:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-25 10:31:25,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-25 10:31:25,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-25 10:31:25,162 INFO L241 CfgBuilder]: Building ICFG [2024-09-25 10:31:25,164 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-25 10:31:25,317 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-25 10:31:25,317 INFO L290 CfgBuilder]: Performing block encoding [2024-09-25 10:31:25,342 INFO L312 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-25 10:31:25,342 INFO L317 CfgBuilder]: Removed 2 assume(true) statements. [2024-09-25 10:31:25,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:25 BoogieIcfgContainer [2024-09-25 10:31:25,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-25 10:31:25,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-25 10:31:25,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-25 10:31:25,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-25 10:31:25,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.09 10:31:24" (1/3) ... [2024-09-25 10:31:25,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f762ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:25, skipping insertion in model container [2024-09-25 10:31:25,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.09 10:31:24" (2/3) ... [2024-09-25 10:31:25,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f762ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.09 10:31:25, skipping insertion in model container [2024-09-25 10:31:25,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.09 10:31:25" (3/3) ... [2024-09-25 10:31:25,351 INFO L112 eAbstractionObserver]: Analyzing ICFG mono-crafted_14.c [2024-09-25 10:31:25,372 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-25 10:31:25,372 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-25 10:31:25,430 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-25 10:31:25,440 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;@45597682, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-25 10:31:25,440 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-25 10:31:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-25 10:31:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:31:25,450 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:25,451 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:25,452 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:25,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1213422553, now seen corresponding path program 1 times [2024-09-25 10:31:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:25,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741437079] [2024-09-25 10:31:25,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,601 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:25,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:25,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741437079] [2024-09-25 10:31:25,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741437079] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:25,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:25,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-25 10:31:25,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146458553] [2024-09-25 10:31:25,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:25,625 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-25 10:31:25,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:25,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-25 10:31:25,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:31:25,647 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:25,668 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2024-09-25 10:31:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-25 10:31:25,671 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:31:25,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:25,676 INFO L225 Difference]: With dead ends: 33 [2024-09-25 10:31:25,677 INFO L226 Difference]: Without dead ends: 16 [2024-09-25 10:31:25,679 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-25 10:31:25,682 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:25,683 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:25,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-09-25 10:31:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-09-25 10:31:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:31:25,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2024-09-25 10:31:25,718 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2024-09-25 10:31:25,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:25,719 INFO L474 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2024-09-25 10:31:25,719 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2024-09-25 10:31:25,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-25 10:31:25,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:25,723 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:25,724 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-25 10:31:25,724 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:25,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash 923436959, now seen corresponding path program 1 times [2024-09-25 10:31:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743267545] [2024-09-25 10:31:25,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,824 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-25 10:31:25,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743267545] [2024-09-25 10:31:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743267545] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088407866] [2024-09-25 10:31:25,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:25,834 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:25,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:25,835 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:25,862 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2024-09-25 10:31:25,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:25,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-25 10:31:25,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:25,865 INFO L225 Difference]: With dead ends: 29 [2024-09-25 10:31:25,866 INFO L226 Difference]: Without dead ends: 18 [2024-09-25 10:31:25,866 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:25,868 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:25,869 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 28 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:25,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-09-25 10:31:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-09-25 10:31:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:31:25,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-09-25 10:31:25,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2024-09-25 10:31:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:25,880 INFO L474 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-09-25 10:31:25,880 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:25,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-09-25 10:31:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-25 10:31:25,882 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:25,882 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:25,883 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-25 10:31:25,884 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:25,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1421107102, now seen corresponding path program 1 times [2024-09-25 10:31:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:25,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040372994] [2024-09-25 10:31:25,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:25,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,967 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:25,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:25,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040372994] [2024-09-25 10:31:25,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040372994] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-25 10:31:25,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-25 10:31:25,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-25 10:31:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259323714] [2024-09-25 10:31:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-25 10:31:25,983 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-25 10:31:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:25,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-25 10:31:25,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:25,984 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:26,009 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-09-25 10:31:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-25 10:31:26,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-09-25 10:31:26,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:26,010 INFO L225 Difference]: With dead ends: 27 [2024-09-25 10:31:26,012 INFO L226 Difference]: Without dead ends: 19 [2024-09-25 10:31:26,012 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-25 10:31:26,013 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:26,015 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-09-25 10:31:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-09-25 10:31:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:31:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-09-25 10:31:26,024 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2024-09-25 10:31:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:26,024 INFO L474 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-09-25 10:31:26,025 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-09-25 10:31:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-25 10:31:26,027 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:26,028 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:26,028 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-25 10:31:26,028 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:26,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:26,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1070032961, now seen corresponding path program 1 times [2024-09-25 10:31:26,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:26,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948313245] [2024-09-25 10:31:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,107 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:26,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948313245] [2024-09-25 10:31:26,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948313245] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:26,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895569852] [2024-09-25 10:31:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:26,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:26,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:26,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:26,122 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-25 10:31:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-25 10:31:26,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:26,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:26,244 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-25 10:31:26,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895569852] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:26,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:26,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-09-25 10:31:26,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634880145] [2024-09-25 10:31:26,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:26,309 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-25 10:31:26,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-25 10:31:26,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-09-25 10:31:26,311 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:26,419 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2024-09-25 10:31:26,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:31:26,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-25 10:31:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:26,423 INFO L225 Difference]: With dead ends: 37 [2024-09-25 10:31:26,423 INFO L226 Difference]: Without dead ends: 25 [2024-09-25 10:31:26,424 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-09-25 10:31:26,425 INFO L434 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:26,425 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 49 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-09-25 10:31:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-09-25 10:31:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:31:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-09-25 10:31:26,434 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2024-09-25 10:31:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:26,435 INFO L474 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-09-25 10:31:26,435 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-09-25 10:31:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-25 10:31:26,437 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:26,437 INFO L216 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:26,455 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:26,637 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:26,638 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:26,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:26,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1037717745, now seen corresponding path program 1 times [2024-09-25 10:31:26,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:26,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142070638] [2024-09-25 10:31:26,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:26,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:26,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:26,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142070638] [2024-09-25 10:31:26,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142070638] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:26,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803583313] [2024-09-25 10:31:26,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:26,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:26,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:26,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:26,777 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-25 10:31:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:26,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-25 10:31:26,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:26,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803583313] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:26,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:26,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-09-25 10:31:26,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269453278] [2024-09-25 10:31:26,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:26,920 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-25 10:31:26,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:26,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-25 10:31:26,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:31:26,922 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:26,970 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-09-25 10:31:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-25 10:31:26,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-25 10:31:26,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:26,973 INFO L225 Difference]: With dead ends: 49 [2024-09-25 10:31:26,974 INFO L226 Difference]: Without dead ends: 33 [2024-09-25 10:31:26,974 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-25 10:31:26,975 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:26,975 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-09-25 10:31:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-09-25 10:31:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:31:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2024-09-25 10:31:26,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 21 [2024-09-25 10:31:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:26,989 INFO L474 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2024-09-25 10:31:26,989 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:26,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2024-09-25 10:31:26,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-25 10:31:26,991 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:26,991 INFO L216 NwaCegarLoop]: trace histogram [8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:27,004 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:27,191 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:27,192 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:27,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash 676738715, now seen corresponding path program 2 times [2024-09-25 10:31:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:27,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760035256] [2024-09-25 10:31:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:27,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:27,386 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760035256] [2024-09-25 10:31:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760035256] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:27,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308940346] [2024-09-25 10:31:27,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:31:27,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:27,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:27,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:27,398 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-25 10:31:27,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:31:27,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:27,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-25 10:31:27,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:27,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:27,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308940346] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:27,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-09-25 10:31:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140659148] [2024-09-25 10:31:27,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:27,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-09-25 10:31:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:27,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-09-25 10:31:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:27,679 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:27,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:27,737 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2024-09-25 10:31:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-25 10:31:27,738 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-25 10:31:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:27,740 INFO L225 Difference]: With dead ends: 65 [2024-09-25 10:31:27,741 INFO L226 Difference]: Without dead ends: 49 [2024-09-25 10:31:27,741 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2024-09-25 10:31:27,742 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:27,742 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-25 10:31:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-09-25 10:31:27,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-09-25 10:31:27,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.119047619047619) internal successors, (47), 43 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-25 10:31:27,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2024-09-25 10:31:27,757 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 29 [2024-09-25 10:31:27,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:27,758 INFO L474 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2024-09-25 10:31:27,758 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:27,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:27,758 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2024-09-25 10:31:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-09-25 10:31:27,759 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:27,760 INFO L216 NwaCegarLoop]: trace histogram [16, 14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:27,780 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-25 10:31:27,960 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-09-25 10:31:27,960 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:27,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:27,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1101291955, now seen corresponding path program 3 times [2024-09-25 10:31:27,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:27,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297813035] [2024-09-25 10:31:27,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:28,395 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-25 10:31:28,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297813035] [2024-09-25 10:31:28,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297813035] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872112323] [2024-09-25 10:31:28,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:31:28,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:28,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:28,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:28,403 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-25 10:31:28,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-25 10:31:28,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:28,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-09-25 10:31:28,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:28,595 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-09-25 10:31:28,595 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2024-09-25 10:31:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872112323] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:28,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 6] total 24 [2024-09-25 10:31:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982492742] [2024-09-25 10:31:28,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:28,821 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-25 10:31:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:28,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-25 10:31:28,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2024-09-25 10:31:28,822 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:29,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:29,172 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2024-09-25 10:31:29,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-25 10:31:29,173 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2024-09-25 10:31:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:29,174 INFO L225 Difference]: With dead ends: 77 [2024-09-25 10:31:29,174 INFO L226 Difference]: Without dead ends: 61 [2024-09-25 10:31:29,175 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2024-09-25 10:31:29,176 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:29,176 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 151 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-25 10:31:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-09-25 10:31:29,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:29,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-09-25 10:31:29,195 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 45 [2024-09-25 10:31:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:29,195 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-09-25 10:31:29,196 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 23 states have internal predecessors, (58), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:29,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-09-25 10:31:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-09-25 10:31:29,198 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:29,198 INFO L216 NwaCegarLoop]: trace histogram [17, 15, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:29,211 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:29,400 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:29,400 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:29,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:29,401 INFO L85 PathProgramCache]: Analyzing trace with hash -897066773, now seen corresponding path program 4 times [2024-09-25 10:31:29,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:29,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658374289] [2024-09-25 10:31:29,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:29,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:29,777 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:31:29,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658374289] [2024-09-25 10:31:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658374289] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727559636] [2024-09-25 10:31:29,783 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:31:29,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:29,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:29,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:29,786 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-25 10:31:29,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:31:29,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:29,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-25 10:31:29,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:31:29,940 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:30,384 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 48 proven. 240 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:31:30,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727559636] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:30,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:30,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-09-25 10:31:30,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031009353] [2024-09-25 10:31:30,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:30,385 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-25 10:31:30,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:30,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-25 10:31:30,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 10:31:30,387 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:30,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:30,527 INFO L93 Difference]: Finished difference Result 113 states and 140 transitions. [2024-09-25 10:31:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-09-25 10:31:30,528 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2024-09-25 10:31:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:30,530 INFO L225 Difference]: With dead ends: 113 [2024-09-25 10:31:30,531 INFO L226 Difference]: Without dead ends: 91 [2024-09-25 10:31:30,531 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2024-09-25 10:31:30,532 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:30,532 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-25 10:31:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-09-25 10:31:30,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-09-25 10:31:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 84 states have internal predecessors, (88), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-09-25 10:31:30,546 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 48 [2024-09-25 10:31:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:30,547 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-09-25 10:31:30,547 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 35 states have internal predecessors, (78), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:30,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-09-25 10:31:30,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-25 10:31:30,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:30,549 INFO L216 NwaCegarLoop]: trace histogram [34, 32, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:30,568 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-25 10:31:30,750 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-25 10:31:30,750 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:30,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:30,750 INFO L85 PathProgramCache]: Analyzing trace with hash 827762136, now seen corresponding path program 5 times [2024-09-25 10:31:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287051980] [2024-09-25 10:31:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:31,869 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:31,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:31:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287051980] [2024-09-25 10:31:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287051980] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405215251] [2024-09-25 10:31:31,875 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-25 10:31:31,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:31,877 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:31,879 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-25 10:31:31,970 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2024-09-25 10:31:31,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:31,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-09-25 10:31:31,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:31:32,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 99 proven. 1056 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:31:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [405215251] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:33,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2024-09-25 10:31:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596654648] [2024-09-25 10:31:33,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:33,605 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2024-09-25 10:31:33,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:33,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2024-09-25 10:31:33,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2024-09-25 10:31:33,610 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 69 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:33,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:33,835 INFO L93 Difference]: Finished difference Result 181 states and 225 transitions. [2024-09-25 10:31:33,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-09-25 10:31:33,835 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2024-09-25 10:31:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:33,837 INFO L225 Difference]: With dead ends: 181 [2024-09-25 10:31:33,837 INFO L226 Difference]: Without dead ends: 159 [2024-09-25 10:31:33,839 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2024-09-25 10:31:33,839 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:33,840 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:31:33,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-09-25 10:31:33,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-09-25 10:31:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 150 states have (on average 1.04) internal successors, (156), 152 states have internal predecessors, (156), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 164 transitions. [2024-09-25 10:31:33,860 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 164 transitions. Word has length 82 [2024-09-25 10:31:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:33,862 INFO L474 AbstractCegarLoop]: Abstraction has 159 states and 164 transitions. [2024-09-25 10:31:33,862 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 69 states have internal predecessors, (146), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:33,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 164 transitions. [2024-09-25 10:31:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-09-25 10:31:33,865 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:33,865 INFO L216 NwaCegarLoop]: trace histogram [68, 66, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:33,889 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-25 10:31:34,065 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:34,066 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:34,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:34,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1698259470, now seen corresponding path program 6 times [2024-09-25 10:31:34,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:34,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048867640] [2024-09-25 10:31:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:34,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:37,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:37,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 201 proven. 4422 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-25 10:31:37,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048867640] [2024-09-25 10:31:37,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048867640] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:37,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083848865] [2024-09-25 10:31:37,695 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-25 10:31:37,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:37,697 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:37,697 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-25 10:31:37,765 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-09-25 10:31:37,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:31:37,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-25 10:31:37,768 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 202 proven. 6 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2024-09-25 10:31:38,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4630 backedges. 202 proven. 6 refuted. 0 times theorem prover too weak. 4422 trivial. 0 not checked. [2024-09-25 10:31:38,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083848865] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:38,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:38,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 7, 7] total 79 [2024-09-25 10:31:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167664271] [2024-09-25 10:31:38,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:38,319 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2024-09-25 10:31:38,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:38,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2024-09-25 10:31:38,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2411, Invalid=3751, Unknown=0, NotChecked=0, Total=6162 [2024-09-25 10:31:38,326 INFO L87 Difference]: Start difference. First operand 159 states and 164 transitions. Second operand has 79 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 79 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:40,259 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2024-09-25 10:31:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-09-25 10:31:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 79 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 150 [2024-09-25 10:31:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:40,261 INFO L225 Difference]: With dead ends: 195 [2024-09-25 10:31:40,261 INFO L226 Difference]: Without dead ends: 173 [2024-09-25 10:31:40,267 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2966 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7570, Invalid=13600, Unknown=0, NotChecked=0, Total=21170 [2024-09-25 10:31:40,267 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:40,268 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 148 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:31:40,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-09-25 10:31:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 167. [2024-09-25 10:31:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 158 states have (on average 1.0379746835443038) internal successors, (164), 160 states have internal predecessors, (164), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 172 transitions. [2024-09-25 10:31:40,284 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 172 transitions. Word has length 150 [2024-09-25 10:31:40,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:40,285 INFO L474 AbstractCegarLoop]: Abstraction has 167 states and 172 transitions. [2024-09-25 10:31:40,285 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.1012658227848102) internal successors, (166), 79 states have internal predecessors, (166), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:40,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,285 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 172 transitions. [2024-09-25 10:31:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-09-25 10:31:40,289 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:40,290 INFO L216 NwaCegarLoop]: trace histogram [69, 67, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:40,302 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:40,490 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:40,490 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:40,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash -629009809, now seen corresponding path program 7 times [2024-09-25 10:31:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:40,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735953756] [2024-09-25 10:31:40,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:43,806 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:31:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 4806 backedges. 204 proven. 4556 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 10:31:43,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:31:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735953756] [2024-09-25 10:31:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735953756] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:31:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736557497] [2024-09-25 10:31:43,811 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-25 10:31:43,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:31:43,812 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:31:43,814 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-25 10:31:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:31:43,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-09-25 10:31:43,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:31:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4806 backedges. 204 proven. 4556 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 10:31:44,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:31:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4806 backedges. 204 proven. 4556 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 10:31:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736557497] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:31:48,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:31:48,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2024-09-25 10:31:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984436521] [2024-09-25 10:31:48,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:31:48,683 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2024-09-25 10:31:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:31:48,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2024-09-25 10:31:48,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2024-09-25 10:31:48,689 INFO L87 Difference]: Start difference. First operand 167 states and 172 transitions. Second operand has 139 states, 139 states have (on average 2.0575539568345325) internal successors, (286), 139 states have internal predecessors, (286), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:31:49,071 INFO L93 Difference]: Finished difference Result 333 states and 412 transitions. [2024-09-25 10:31:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-09-25 10:31:49,072 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 2.0575539568345325) internal successors, (286), 139 states have internal predecessors, (286), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 158 [2024-09-25 10:31:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:31:49,074 INFO L225 Difference]: With dead ends: 333 [2024-09-25 10:31:49,074 INFO L226 Difference]: Without dead ends: 305 [2024-09-25 10:31:49,076 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2024-09-25 10:31:49,076 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-25 10:31:49,077 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-25 10:31:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-09-25 10:31:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-09-25 10:31:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 296 states have (on average 1.0202702702702702) internal successors, (302), 298 states have internal predecessors, (302), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:31:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 310 transitions. [2024-09-25 10:31:49,106 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 310 transitions. Word has length 158 [2024-09-25 10:31:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:31:49,106 INFO L474 AbstractCegarLoop]: Abstraction has 305 states and 310 transitions. [2024-09-25 10:31:49,107 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 2.0575539568345325) internal successors, (286), 139 states have internal predecessors, (286), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:31:49,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 310 transitions. [2024-09-25 10:31:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-09-25 10:31:49,110 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:31:49,110 INFO L216 NwaCegarLoop]: trace histogram [138, 136, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:31:49,125 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-25 10:31:49,311 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:31:49,311 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:31:49,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:31:49,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1946243840, now seen corresponding path program 8 times [2024-09-25 10:31:49,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:31:49,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955396043] [2024-09-25 10:31:49,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:31:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:31:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:02,389 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:32:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:32:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 19089 backedges. 411 proven. 18632 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 10:32:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:32:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955396043] [2024-09-25 10:32:02,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955396043] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:32:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973215452] [2024-09-25 10:32:02,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-25 10:32:02,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:32:02,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:32:02,398 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:32:02,399 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-25 10:32:02,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-25 10:32:02,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:32:02,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 274 conjuncts are in the unsatisfiable core [2024-09-25 10:32:02,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:32:02,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19089 backedges. 411 proven. 18632 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 10:32:02,931 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:32:20,693 INFO L134 CoverageAnalysis]: Checked inductivity of 19089 backedges. 411 proven. 18632 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 10:32:20,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973215452] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:32:20,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:32:20,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 277 [2024-09-25 10:32:20,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583233737] [2024-09-25 10:32:20,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:32:20,695 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 277 states [2024-09-25 10:32:20,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:32:20,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 277 interpolants. [2024-09-25 10:32:20,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38226, Invalid=38226, Unknown=0, NotChecked=0, Total=76452 [2024-09-25 10:32:20,711 INFO L87 Difference]: Start difference. First operand 305 states and 310 transitions. Second operand has 277 states, 277 states have (on average 2.0288808664259927) internal successors, (562), 277 states have internal predecessors, (562), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:21,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:32:21,971 INFO L93 Difference]: Finished difference Result 609 states and 757 transitions. [2024-09-25 10:32:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2024-09-25 10:32:21,972 INFO L78 Accepts]: Start accepts. Automaton has has 277 states, 277 states have (on average 2.0288808664259927) internal successors, (562), 277 states have internal predecessors, (562), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 296 [2024-09-25 10:32:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:32:21,975 INFO L225 Difference]: With dead ends: 609 [2024-09-25 10:32:21,975 INFO L226 Difference]: Without dead ends: 581 [2024-09-25 10:32:21,979 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=38226, Invalid=38226, Unknown=0, NotChecked=0, Total=76452 [2024-09-25 10:32:21,980 INFO L434 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-25 10:32:21,980 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-25 10:32:21,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-09-25 10:32:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2024-09-25 10:32:22,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 572 states have (on average 1.0104895104895104) internal successors, (578), 574 states have internal predecessors, (578), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:32:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 586 transitions. [2024-09-25 10:32:22,026 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 586 transitions. Word has length 296 [2024-09-25 10:32:22,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:32:22,027 INFO L474 AbstractCegarLoop]: Abstraction has 581 states and 586 transitions. [2024-09-25 10:32:22,027 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 277 states, 277 states have (on average 2.0288808664259927) internal successors, (562), 277 states have internal predecessors, (562), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:32:22,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 586 transitions. [2024-09-25 10:32:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2024-09-25 10:32:22,036 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:32:22,036 INFO L216 NwaCegarLoop]: trace histogram [276, 274, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:32:22,054 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-25 10:32:22,236 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-25 10:32:22,237 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:32:22,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:32:22,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1450148254, now seen corresponding path program 9 times [2024-09-25 10:32:22,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:32:22,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339506320] [2024-09-25 10:32:22,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:32:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:32:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:25,827 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:33:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:33:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 76221 backedges. 825 proven. 75350 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-09-25 10:33:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:33:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339506320] [2024-09-25 10:33:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339506320] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:33:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943230576] [2024-09-25 10:33:25,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-25 10:33:25,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:33:25,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:33:25,839 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:33:25,840 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-25 10:33:25,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-25 10:33:25,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:33:25,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-09-25 10:33:26,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:33:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 76221 backedges. 826 proven. 45 refuted. 0 times theorem prover too weak. 75350 trivial. 0 not checked. [2024-09-25 10:33:27,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-25 10:33:28,999 INFO L134 CoverageAnalysis]: Checked inductivity of 76221 backedges. 826 proven. 45 refuted. 0 times theorem prover too weak. 75350 trivial. 0 not checked. [2024-09-25 10:33:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943230576] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-25 10:33:29,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-25 10:33:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [277, 13, 13] total 299 [2024-09-25 10:33:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426083797] [2024-09-25 10:33:29,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-25 10:33:29,001 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 299 states [2024-09-25 10:33:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-25 10:33:29,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 299 interpolants. [2024-09-25 10:33:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38501, Invalid=50601, Unknown=0, NotChecked=0, Total=89102 [2024-09-25 10:33:29,018 INFO L87 Difference]: Start difference. First operand 581 states and 586 transitions. Second operand has 299 states, 299 states have (on average 1.9866220735785953) internal successors, (594), 299 states have internal predecessors, (594), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-25 10:33:57,061 INFO L93 Difference]: Finished difference Result 629 states and 655 transitions. [2024-09-25 10:33:57,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2024-09-25 10:33:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 299 states, 299 states have (on average 1.9866220735785953) internal successors, (594), 299 states have internal predecessors, (594), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 572 [2024-09-25 10:33:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-25 10:33:57,065 INFO L225 Difference]: With dead ends: 629 [2024-09-25 10:33:57,065 INFO L226 Difference]: Without dead ends: 601 [2024-09-25 10:33:57,076 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 1697 GetRequests, 1125 SyntacticMatches, 0 SemanticMatches, 572 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44054 ImplicationChecksByTransitivity, 51.3s TimeCoverageRelationStatistics Valid=120176, Invalid=208726, Unknown=0, NotChecked=0, Total=328902 [2024-09-25 10:33:57,077 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-25 10:33:57,077 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-25 10:33:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2024-09-25 10:33:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 595. [2024-09-25 10:33:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 586 states have (on average 1.0102389078498293) internal successors, (592), 588 states have internal predecessors, (592), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-25 10:33:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 600 transitions. [2024-09-25 10:33:57,118 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 600 transitions. Word has length 572 [2024-09-25 10:33:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-25 10:33:57,119 INFO L474 AbstractCegarLoop]: Abstraction has 595 states and 600 transitions. [2024-09-25 10:33:57,120 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 299 states, 299 states have (on average 1.9866220735785953) internal successors, (594), 299 states have internal predecessors, (594), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-25 10:33:57,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 600 transitions. [2024-09-25 10:33:57,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2024-09-25 10:33:57,130 INFO L208 NwaCegarLoop]: Found error trace [2024-09-25 10:33:57,130 INFO L216 NwaCegarLoop]: trace histogram [277, 275, 21, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-25 10:33:57,148 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-25 10:33:57,334 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-25 10:33:57,335 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-25 10:33:57,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-25 10:33:57,335 INFO L85 PathProgramCache]: Analyzing trace with hash -492529089, now seen corresponding path program 10 times [2024-09-25 10:33:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-25 10:33:57,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075033794] [2024-09-25 10:33:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-25 10:33:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-25 10:33:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:03,767 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-25 10:35:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-25 10:35:03,773 INFO L134 CoverageAnalysis]: Checked inductivity of 76960 backedges. 828 proven. 75900 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-25 10:35:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-25 10:35:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075033794] [2024-09-25 10:35:03,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075033794] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-25 10:35:03,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908629360] [2024-09-25 10:35:03,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-25 10:35:03,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-25 10:35:03,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-25 10:35:03,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-25 10:35:03,776 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-25 10:35:04,142 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-25 10:35:04,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-25 10:35:04,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 1854 conjuncts, 552 conjuncts are in the unsatisfiable core [2024-09-25 10:35:04,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-25 10:35:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 76960 backedges. 828 proven. 75900 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-09-25 10:35:04,858 INFO L327 TraceCheckSpWp]: Computing backward predicates...