./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/gcd02.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/gcd02.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 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-11 20:25:18,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-11 20:25:19,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-11 20:25:19,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-11 20:25:19,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-11 20:25:19,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-11 20:25:19,030 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-11 20:25:19,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-11 20:25:19,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-11 20:25:19,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-11 20:25:19,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-11 20:25:19,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-11 20:25:19,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-11 20:25:19,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-11 20:25:19,033 INFO L153 SettingsManager]: * Use SBE=true [2024-09-11 20:25:19,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-11 20:25:19,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-11 20:25:19,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-11 20:25:19,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-11 20:25:19,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-11 20:25:19,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-11 20:25:19,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-11 20:25:19,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-11 20:25:19,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-11 20:25:19,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-11 20:25:19,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-11 20:25:19,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-11 20:25:19,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-11 20:25:19,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-11 20:25:19,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-11 20:25:19,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-11 20:25:19,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-11 20:25:19,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:19,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-11 20:25:19,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-11 20:25:19,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-11 20:25:19,046 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-11 20:25:19,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-11 20:25:19,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-11 20:25:19,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-11 20:25:19,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-11 20:25:19,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-11 20:25:19,048 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 -> 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-11 20:25:19,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-11 20:25:19,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-11 20:25:19,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-11 20:25:19,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-11 20:25:19,335 INFO L274 PluginConnector]: CDTParser initialized [2024-09-11 20:25:19,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/gcd02.c [2024-09-11 20:25:20,725 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-11 20:25:20,948 INFO L384 CDTParser]: Found 1 translation units. [2024-09-11 20:25:20,949 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c [2024-09-11 20:25:20,959 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/dae797079/b88f8c30f4b845abad9a5aa3ebf0551a/FLAG61372b608 [2024-09-11 20:25:20,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/dae797079/b88f8c30f4b845abad9a5aa3ebf0551a [2024-09-11 20:25:20,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-11 20:25:20,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-11 20:25:20,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:20,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-11 20:25:21,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-11 20:25:21,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:20" (1/1) ... [2024-09-11 20:25:21,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640508f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21, skipping insertion in model container [2024-09-11 20:25:21,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.09 08:25:20" (1/1) ... [2024-09-11 20:25:21,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-11 20:25:21,175 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c[623,636] [2024-09-11 20:25:21,191 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2024-09-11 20:25:21,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:21,209 INFO L200 MainTranslator]: Completed pre-run [2024-09-11 20:25:21,221 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c[623,636] [2024-09-11 20:25:21,228 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c[1283,1296] [2024-09-11 20:25:21,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-11 20:25:21,246 INFO L204 MainTranslator]: Completed translation [2024-09-11 20:25:21,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21 WrapperNode [2024-09-11 20:25:21,247 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-11 20:25:21,248 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:21,248 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-11 20:25:21,248 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-11 20:25:21,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,282 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-09-11 20:25:21,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-11 20:25:21,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-11 20:25:21,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-11 20:25:21,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-11 20:25:21,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,321 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-09-11 20:25:21,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-11 20:25:21,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-11 20:25:21,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-11 20:25:21,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-11 20:25:21,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (1/1) ... [2024-09-11 20:25:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-11 20:25:21,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:21,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-11 20:25:21,374 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-11 20:25:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-11 20:25:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-09-11 20:25:21,419 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-09-11 20:25:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-11 20:25:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-11 20:25:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2024-09-11 20:25:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2024-09-11 20:25:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-11 20:25:21,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-11 20:25:21,488 INFO L242 CfgBuilder]: Building ICFG [2024-09-11 20:25:21,490 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-11 20:25:21,672 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-09-11 20:25:21,673 INFO L291 CfgBuilder]: Performing block encoding [2024-09-11 20:25:21,712 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-11 20:25:21,713 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-11 20:25:21,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:21 BoogieIcfgContainer [2024-09-11 20:25:21,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-11 20:25:21,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-11 20:25:21,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-11 20:25:21,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-11 20:25:21,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.09 08:25:20" (1/3) ... [2024-09-11 20:25:21,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0b7720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:21, skipping insertion in model container [2024-09-11 20:25:21,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.09 08:25:21" (2/3) ... [2024-09-11 20:25:21,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0b7720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.09 08:25:21, skipping insertion in model container [2024-09-11 20:25:21,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.09 08:25:21" (3/3) ... [2024-09-11 20:25:21,722 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2024-09-11 20:25:21,741 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-11 20:25:21,741 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-11 20:25:21,790 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-11 20:25:21,799 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;@56a15689, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-11 20:25:21,800 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-11 20:25:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:25:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-11 20:25:21,813 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:21,814 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:21,815 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:21,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash 192890080, now seen corresponding path program 1 times [2024-09-11 20:25:21,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:21,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149706060] [2024-09-11 20:25:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:21,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:22,203 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-11 20:25:22,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:22,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149706060] [2024-09-11 20:25:22,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149706060] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:22,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:22,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:22,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319351889] [2024-09-11 20:25:22,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:22,216 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:22,241 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:25:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:22,380 INFO L93 Difference]: Finished difference Result 75 states and 105 transitions. [2024-09-11 20:25:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:25:22,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-09-11 20:25:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:22,390 INFO L225 Difference]: With dead ends: 75 [2024-09-11 20:25:22,390 INFO L226 Difference]: Without dead ends: 44 [2024-09-11 20:25:22,393 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:25:22,400 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:22,401 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 135 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:22,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-09-11 20:25:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2024-09-11 20:25:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-11 20:25:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-09-11 20:25:22,446 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 8 [2024-09-11 20:25:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:22,447 INFO L474 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-09-11 20:25:22,447 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:25:22,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2024-09-11 20:25:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 20:25:22,448 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:22,448 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:22,451 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-11 20:25:22,451 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:22,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:22,452 INFO L85 PathProgramCache]: Analyzing trace with hash -344313825, now seen corresponding path program 1 times [2024-09-11 20:25:22,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:22,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514502663] [2024-09-11 20:25:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:22,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:25:22,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:22,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514502663] [2024-09-11 20:25:22,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514502663] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:22,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:22,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-11 20:25:22,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14791211] [2024-09-11 20:25:22,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:22,622 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-11 20:25:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:22,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-11 20:25:22,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-11 20:25:22,626 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:25:22,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:22,757 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2024-09-11 20:25:22,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-11 20:25:22,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-11 20:25:22,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:22,760 INFO L225 Difference]: With dead ends: 64 [2024-09-11 20:25:22,760 INFO L226 Difference]: Without dead ends: 62 [2024-09-11 20:25:22,760 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:25:22,761 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:22,762 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 125 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-11 20:25:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-09-11 20:25:22,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:25:22,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-09-11 20:25:22,786 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 13 [2024-09-11 20:25:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:22,787 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-09-11 20:25:22,787 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:25:22,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:22,791 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-09-11 20:25:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-09-11 20:25:22,791 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:22,792 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:22,792 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-11 20:25:22,792 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:22,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:22,793 INFO L85 PathProgramCache]: Analyzing trace with hash -341483680, now seen corresponding path program 1 times [2024-09-11 20:25:22,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54628929] [2024-09-11 20:25:22,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-11 20:25:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54628929] [2024-09-11 20:25:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54628929] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-11 20:25:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74879963] [2024-09-11 20:25:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:22,968 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-11 20:25:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-11 20:25:22,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-11 20:25:22,971 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:25:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:23,132 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2024-09-11 20:25:23,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-11 20:25:23,132 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-09-11 20:25:23,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:23,136 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:25:23,136 INFO L226 Difference]: Without dead ends: 60 [2024-09-11 20:25:23,136 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:25:23,137 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:23,139 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 182 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:23,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-11 20:25:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2024-09-11 20:25:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:25:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-09-11 20:25:23,169 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 13 [2024-09-11 20:25:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:23,169 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-09-11 20:25:23,169 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-11 20:25:23,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-09-11 20:25:23,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-11 20:25:23,173 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:23,174 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:23,174 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-11 20:25:23,174 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:23,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,175 INFO L85 PathProgramCache]: Analyzing trace with hash -205465366, now seen corresponding path program 1 times [2024-09-11 20:25:23,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103615825] [2024-09-11 20:25:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:23,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,250 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,256 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 20:25:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,284 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-11 20:25:23,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:23,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103615825] [2024-09-11 20:25:23,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103615825] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:23,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:23,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-11 20:25:23,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370625130] [2024-09-11 20:25:23,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:23,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-11 20:25:23,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:23,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-11 20:25:23,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 20:25:23,287 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:23,315 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2024-09-11 20:25:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-11 20:25:23,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-09-11 20:25:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:23,320 INFO L225 Difference]: With dead ends: 54 [2024-09-11 20:25:23,320 INFO L226 Difference]: Without dead ends: 50 [2024-09-11 20:25:23,321 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-11 20:25:23,322 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:23,322 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-09-11 20:25:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-09-11 20:25:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-09-11 20:25:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2024-09-11 20:25:23,337 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 19 [2024-09-11 20:25:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:23,337 INFO L474 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2024-09-11 20:25:23,337 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-11 20:25:23,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,338 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2024-09-11 20:25:23,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-11 20:25:23,339 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:23,339 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:23,339 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-11 20:25:23,339 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:23,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1363529512, now seen corresponding path program 1 times [2024-09-11 20:25:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:23,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672445360] [2024-09-11 20:25:23,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,424 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 20:25:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,544 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-11 20:25:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672445360] [2024-09-11 20:25:23,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672445360] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:23,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:23,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-11 20:25:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642551359] [2024-09-11 20:25:23,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:23,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-11 20:25:23,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-11 20:25:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:25:23,549 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:23,707 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2024-09-11 20:25:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-11 20:25:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-11 20:25:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:23,710 INFO L225 Difference]: With dead ends: 68 [2024-09-11 20:25:23,712 INFO L226 Difference]: Without dead ends: 64 [2024-09-11 20:25:23,713 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-11 20:25:23,713 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:23,714 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 113 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-11 20:25:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2024-09-11 20:25:23,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-09-11 20:25:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-09-11 20:25:23,743 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 20 [2024-09-11 20:25:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:23,743 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-09-11 20:25:23,743 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-11 20:25:23,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-09-11 20:25:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-11 20:25:23,745 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:23,745 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:23,745 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-11 20:25:23,745 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:23,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1456991186, now seen corresponding path program 1 times [2024-09-11 20:25:23,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:23,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297759660] [2024-09-11 20:25:23,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,798 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,803 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 20:25:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:25:23,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:23,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297759660] [2024-09-11 20:25:23,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297759660] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:23,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:23,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-11 20:25:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966420597] [2024-09-11 20:25:23,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:23,851 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-11 20:25:23,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:23,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-11 20:25:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:25:23,852 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:25:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:23,888 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-09-11 20:25:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-11 20:25:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-09-11 20:25:23,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:23,889 INFO L225 Difference]: With dead ends: 63 [2024-09-11 20:25:23,890 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 20:25:23,890 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-11 20:25:23,891 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:23,891 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-11 20:25:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 20:25:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-11 20:25:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 4 states have call predecessors, (10), 6 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2024-09-11 20:25:23,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2024-09-11 20:25:23,913 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 26 [2024-09-11 20:25:23,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:23,913 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2024-09-11 20:25:23,913 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-11 20:25:23,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2024-09-11 20:25:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-11 20:25:23,917 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:23,917 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:23,918 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-11 20:25:23,918 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:23,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1678448864, now seen corresponding path program 1 times [2024-09-11 20:25:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:23,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241344018] [2024-09-11 20:25:23,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:23,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:24,006 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:24,026 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-09-11 20:25:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:24,074 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:24,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241344018] [2024-09-11 20:25:24,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241344018] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438748229] [2024-09-11 20:25:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:24,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:24,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:24,171 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-11 20:25:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:24,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-11 20:25:24,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:24,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-11 20:25:24,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438748229] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:24,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:24,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2024-09-11 20:25:24,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553612091] [2024-09-11 20:25:24,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:24,500 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-11 20:25:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-11 20:25:24,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-09-11 20:25:24,501 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:25:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:24,676 INFO L93 Difference]: Finished difference Result 62 states and 78 transitions. [2024-09-11 20:25:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:25:24,676 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2024-09-11 20:25:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:24,678 INFO L225 Difference]: With dead ends: 62 [2024-09-11 20:25:24,678 INFO L226 Difference]: Without dead ends: 54 [2024-09-11 20:25:24,679 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-09-11 20:25:24,680 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:24,680 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 114 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-11 20:25:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2024-09-11 20:25:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-09-11 20:25:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-09-11 20:25:24,697 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 27 [2024-09-11 20:25:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:24,697 INFO L474 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-09-11 20:25:24,697 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-11 20:25:24,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:24,697 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-09-11 20:25:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:25:24,699 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:24,699 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:24,717 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-11 20:25:24,900 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-09-11 20:25:24,900 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:24,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1626959476, now seen corresponding path program 1 times [2024-09-11 20:25:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:24,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826290685] [2024-09-11 20:25:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:24,983 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:25,039 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:25,071 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:25:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:25:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826290685] [2024-09-11 20:25:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826290685] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:25,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977747408] [2024-09-11 20:25:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:25,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:25,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:25,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:25,119 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-11 20:25:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:25,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-11 20:25:25,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:25:25,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:25:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977747408] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:25,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-09-11 20:25:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041333181] [2024-09-11 20:25:25,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:25,628 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:25:25,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:25,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:25:25,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:25:25,629 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-11 20:25:25,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:25,839 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2024-09-11 20:25:25,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:25:25,840 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 28 [2024-09-11 20:25:25,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:25,841 INFO L225 Difference]: With dead ends: 73 [2024-09-11 20:25:25,841 INFO L226 Difference]: Without dead ends: 69 [2024-09-11 20:25:25,841 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:25:25,842 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:25,842 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 178 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-11 20:25:25,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2024-09-11 20:25:25,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 10 states have call successors, (10), 4 states have call predecessors, (10), 7 states have return successors, (16), 12 states have call predecessors, (16), 10 states have call successors, (16) [2024-09-11 20:25:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-09-11 20:25:25,857 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2024-09-11 20:25:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:25,858 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-09-11 20:25:25,858 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 17 states have internal predecessors, (40), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-11 20:25:25,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:25,858 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-09-11 20:25:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-11 20:25:25,859 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:25,859 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:25,876 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-11 20:25:26,063 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:26,064 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:26,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2138734868, now seen corresponding path program 1 times [2024-09-11 20:25:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:26,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073365870] [2024-09-11 20:25:26,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:26,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,113 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:25:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:25:26,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:26,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073365870] [2024-09-11 20:25:26,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073365870] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-11 20:25:26,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-11 20:25:26,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-11 20:25:26,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042993901] [2024-09-11 20:25:26,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-11 20:25:26,229 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-11 20:25:26,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-11 20:25:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-11 20:25:26,231 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:25:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:26,399 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-09-11 20:25:26,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-11 20:25:26,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2024-09-11 20:25:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:26,402 INFO L225 Difference]: With dead ends: 81 [2024-09-11 20:25:26,402 INFO L226 Difference]: Without dead ends: 77 [2024-09-11 20:25:26,402 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-09-11 20:25:26,403 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:26,403 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 149 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-09-11 20:25:26,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2024-09-11 20:25:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 8 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2024-09-11 20:25:26,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-09-11 20:25:26,425 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 28 [2024-09-11 20:25:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:26,426 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-09-11 20:25:26,426 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-11 20:25:26,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-09-11 20:25:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:25:26,437 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:26,438 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:26,438 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-11 20:25:26,438 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:26,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1097221548, now seen corresponding path program 1 times [2024-09-11 20:25:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801700868] [2024-09-11 20:25:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,529 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,580 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,622 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:25:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,690 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:25:26,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801700868] [2024-09-11 20:25:26,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801700868] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:26,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898679607] [2024-09-11 20:25:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:26,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:26,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:26,721 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:26,723 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-11 20:25:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:26,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-11 20:25:26,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:25:26,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-11 20:25:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898679607] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:27,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:27,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 21 [2024-09-11 20:25:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574993223] [2024-09-11 20:25:27,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:27,588 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:25:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:27,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:25:27,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-09-11 20:25:27,590 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:25:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:27,835 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2024-09-11 20:25:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-11 20:25:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) Word has length 35 [2024-09-11 20:25:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:27,836 INFO L225 Difference]: With dead ends: 88 [2024-09-11 20:25:27,836 INFO L226 Difference]: Without dead ends: 84 [2024-09-11 20:25:27,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2024-09-11 20:25:27,837 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:27,837 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 181 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-09-11 20:25:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2024-09-11 20:25:27,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 50 states have internal predecessors, (55), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (27), 17 states have call predecessors, (27), 11 states have call successors, (27) [2024-09-11 20:25:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2024-09-11 20:25:27,860 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 35 [2024-09-11 20:25:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:27,860 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2024-09-11 20:25:27,861 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 19 states have internal predecessors, (51), 8 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-11 20:25:27,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2024-09-11 20:25:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-09-11 20:25:27,864 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:27,864 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:27,881 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-11 20:25:28,068 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-09-11 20:25:28,069 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:28,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634932, now seen corresponding path program 1 times [2024-09-11 20:25:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:28,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384576017] [2024-09-11 20:25:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:28,138 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:28,169 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:28,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:25:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:28,216 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:28,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:28,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384576017] [2024-09-11 20:25:28,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384576017] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:28,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906430294] [2024-09-11 20:25:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:28,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:28,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:28,281 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:28,283 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-11 20:25:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:28,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-11 20:25:28,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:28,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:28,578 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:28,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906430294] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:28,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:28,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-09-11 20:25:28,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353938678] [2024-09-11 20:25:28,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:28,579 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-11 20:25:28,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:28,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-11 20:25:28,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-09-11 20:25:28,580 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:25:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:28,775 INFO L93 Difference]: Finished difference Result 85 states and 111 transitions. [2024-09-11 20:25:28,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:25:28,775 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 35 [2024-09-11 20:25:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:28,776 INFO L225 Difference]: With dead ends: 85 [2024-09-11 20:25:28,776 INFO L226 Difference]: Without dead ends: 76 [2024-09-11 20:25:28,777 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-09-11 20:25:28,777 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 12 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:28,778 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 155 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-11 20:25:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-11 20:25:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2024-09-11 20:25:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.125) internal successors, (54), 50 states have internal predecessors, (54), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (26), 16 states have call predecessors, (26), 11 states have call successors, (26) [2024-09-11 20:25:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-09-11 20:25:28,794 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 35 [2024-09-11 20:25:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:28,794 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-09-11 20:25:28,795 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-11 20:25:28,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-09-11 20:25:28,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 20:25:28,796 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:28,796 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:28,812 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-11 20:25:29,000 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:29,001 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:29,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:29,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2077305336, now seen corresponding path program 1 times [2024-09-11 20:25:29,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:29,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728360285] [2024-09-11 20:25:29,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:29,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:29,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:29,064 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:29,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:29,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:29,223 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:29,241 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:25:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:29,278 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-11 20:25:29,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:29,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728360285] [2024-09-11 20:25:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728360285] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958060189] [2024-09-11 20:25:29,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:29,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:29,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:29,280 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:29,281 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-09-11 20:25:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:29,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-11 20:25:29,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:29,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:25:29,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:30,426 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:25:30,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958060189] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:30,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:30,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 39 [2024-09-11 20:25:30,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359869532] [2024-09-11 20:25:30,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:30,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-11 20:25:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:30,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-11 20:25:30,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2024-09-11 20:25:30,429 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 39 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 9 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-11 20:25:31,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:31,046 INFO L93 Difference]: Finished difference Result 102 states and 133 transitions. [2024-09-11 20:25:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-11 20:25:31,047 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 9 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) Word has length 36 [2024-09-11 20:25:31,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:31,048 INFO L225 Difference]: With dead ends: 102 [2024-09-11 20:25:31,048 INFO L226 Difference]: Without dead ends: 98 [2024-09-11 20:25:31,049 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=2027, Unknown=0, NotChecked=0, Total=2352 [2024-09-11 20:25:31,050 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:31,050 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 389 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-11 20:25:31,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-11 20:25:31,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 67. [2024-09-11 20:25:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 11 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (23), 14 states have call predecessors, (23), 11 states have call successors, (23) [2024-09-11 20:25:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2024-09-11 20:25:31,068 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 36 [2024-09-11 20:25:31,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:31,068 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2024-09-11 20:25:31,068 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 32 states have (on average 1.875) internal successors, (60), 31 states have internal predecessors, (60), 9 states have call successors, (9), 1 states have call predecessors, (9), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-11 20:25:31,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2024-09-11 20:25:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-11 20:25:31,069 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:31,069 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:31,082 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-11 20:25:31,270 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-11 20:25:31,270 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:31,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 511799736, now seen corresponding path program 2 times [2024-09-11 20:25:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:31,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260480587] [2024-09-11 20:25:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:31,328 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:31,375 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:31,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:31,427 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:25:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 20:25:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:31,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260480587] [2024-09-11 20:25:31,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260480587] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830789496] [2024-09-11 20:25:31,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:25:31,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:31,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:31,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:31,461 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-09-11 20:25:31,519 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:25:31,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:31,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-11 20:25:31,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:25:31,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-11 20:25:32,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830789496] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:32,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:32,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 23 [2024-09-11 20:25:32,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045027081] [2024-09-11 20:25:32,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:32,139 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-11 20:25:32,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:32,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-11 20:25:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-09-11 20:25:32,140 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 23 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-11 20:25:32,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:32,463 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2024-09-11 20:25:32,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-11 20:25:32,463 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) Word has length 36 [2024-09-11 20:25:32,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:32,464 INFO L225 Difference]: With dead ends: 80 [2024-09-11 20:25:32,464 INFO L226 Difference]: Without dead ends: 76 [2024-09-11 20:25:32,465 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 20:25:32,466 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:32,466 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 214 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-09-11 20:25:32,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2024-09-11 20:25:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 45 states have internal predecessors, (49), 10 states have call successors, (10), 4 states have call predecessors, (10), 9 states have return successors, (19), 13 states have call predecessors, (19), 10 states have call successors, (19) [2024-09-11 20:25:32,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 78 transitions. [2024-09-11 20:25:32,479 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 78 transitions. Word has length 36 [2024-09-11 20:25:32,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:32,480 INFO L474 AbstractCegarLoop]: Abstraction has 63 states and 78 transitions. [2024-09-11 20:25:32,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-11 20:25:32,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:32,480 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 78 transitions. [2024-09-11 20:25:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:25:32,481 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:32,481 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:32,497 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-11 20:25:32,681 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-11 20:25:32,682 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:32,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2085961572, now seen corresponding path program 2 times [2024-09-11 20:25:32,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:32,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850281812] [2024-09-11 20:25:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:32,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,942 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:25:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:32,997 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:33,031 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:33,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850281812] [2024-09-11 20:25:33,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850281812] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:33,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116890116] [2024-09-11 20:25:33,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:25:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:33,061 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:33,062 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-09-11 20:25:33,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:25:33,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:33,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-11 20:25:33,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:33,311 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:33,312 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116890116] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:34,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18] total 27 [2024-09-11 20:25:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143473424] [2024-09-11 20:25:34,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:34,562 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-11 20:25:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-11 20:25:34,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2024-09-11 20:25:34,564 INFO L87 Difference]: Start difference. First operand 63 states and 78 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-11 20:25:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:34,992 INFO L93 Difference]: Finished difference Result 93 states and 120 transitions. [2024-09-11 20:25:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:25:34,992 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) Word has length 50 [2024-09-11 20:25:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:34,993 INFO L225 Difference]: With dead ends: 93 [2024-09-11 20:25:34,993 INFO L226 Difference]: Without dead ends: 89 [2024-09-11 20:25:34,994 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 88 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 20:25:34,994 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 26 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:34,995 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 365 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:25:34,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-11 20:25:35,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2024-09-11 20:25:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 11 states have call successors, (11), 4 states have call predecessors, (11), 12 states have return successors, (28), 17 states have call predecessors, (28), 11 states have call successors, (28) [2024-09-11 20:25:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2024-09-11 20:25:35,022 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 50 [2024-09-11 20:25:35,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:35,022 INFO L474 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2024-09-11 20:25:35,023 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (14), 7 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-11 20:25:35,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:35,023 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2024-09-11 20:25:35,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-09-11 20:25:35,024 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:35,024 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:35,038 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-11 20:25:35,228 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:35,229 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:35,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -267988016, now seen corresponding path program 3 times [2024-09-11 20:25:35,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006888022] [2024-09-11 20:25:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:35,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:35,354 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:35,387 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-09-11 20:25:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:35,438 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:35,488 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006888022] [2024-09-11 20:25:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006888022] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37208255] [2024-09-11 20:25:35,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:25:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:35,540 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:35,541 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-09-11 20:25:35,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-11 20:25:35,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:35,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-11 20:25:35,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-11 20:25:35,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:25:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37208255] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:36,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:36,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 32 [2024-09-11 20:25:36,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715042894] [2024-09-11 20:25:36,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:36,442 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-09-11 20:25:36,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:36,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-09-11 20:25:36,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2024-09-11 20:25:36,444 INFO L87 Difference]: Start difference. First operand 74 states and 95 transitions. Second operand has 32 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-11 20:25:36,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:36,798 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2024-09-11 20:25:36,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:25:36,798 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 12 states have call successors, (13) Word has length 42 [2024-09-11 20:25:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:36,800 INFO L225 Difference]: With dead ends: 83 [2024-09-11 20:25:36,800 INFO L226 Difference]: Without dead ends: 74 [2024-09-11 20:25:36,801 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2024-09-11 20:25:36,801 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 43 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:36,801 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 300 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-11 20:25:36,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2024-09-11 20:25:36,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 10 states have call successors, (10), 4 states have call predecessors, (10), 11 states have return successors, (24), 15 states have call predecessors, (24), 10 states have call successors, (24) [2024-09-11 20:25:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-09-11 20:25:36,818 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 42 [2024-09-11 20:25:36,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:36,818 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-09-11 20:25:36,819 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.3333333333333335) internal successors, (63), 28 states have internal predecessors, (63), 12 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-11 20:25:36,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-09-11 20:25:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-11 20:25:36,820 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:36,820 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:36,832 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-09-11 20:25:37,020 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:37,021 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:37,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -755000384, now seen corresponding path program 1 times [2024-09-11 20:25:37,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:37,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768130225] [2024-09-11 20:25:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:37,086 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:37,146 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:37,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:37,218 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:37,237 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:25:37,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:37,279 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-11 20:25:37,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:37,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768130225] [2024-09-11 20:25:37,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768130225] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:37,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116064373] [2024-09-11 20:25:37,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:37,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:37,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:37,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:37,308 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-09-11 20:25:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:37,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-11 20:25:37,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-11 20:25:37,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-11 20:25:38,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116064373] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:38,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:38,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 33 [2024-09-11 20:25:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551704401] [2024-09-11 20:25:38,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:38,459 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-09-11 20:25:38,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:38,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-09-11 20:25:38,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2024-09-11 20:25:38,460 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 33 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 26 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-11 20:25:38,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:38,982 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2024-09-11 20:25:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-11 20:25:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 26 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) Word has length 43 [2024-09-11 20:25:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:38,987 INFO L225 Difference]: With dead ends: 111 [2024-09-11 20:25:38,987 INFO L226 Difference]: Without dead ends: 107 [2024-09-11 20:25:38,989 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1727, Unknown=0, NotChecked=0, Total=1980 [2024-09-11 20:25:38,989 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:38,989 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 336 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:25:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-09-11 20:25:39,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 81. [2024-09-11 20:25:39,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 11 states have call successors, (11), 4 states have call predecessors, (11), 14 states have return successors, (32), 20 states have call predecessors, (32), 11 states have call successors, (32) [2024-09-11 20:25:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2024-09-11 20:25:39,018 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 43 [2024-09-11 20:25:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:39,019 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2024-09-11 20:25:39,019 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 26 states have internal predecessors, (67), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (13), 9 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-11 20:25:39,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:39,022 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2024-09-11 20:25:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-11 20:25:39,022 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:39,022 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:39,039 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-11 20:25:39,223 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-11 20:25:39,223 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:39,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash 648223744, now seen corresponding path program 2 times [2024-09-11 20:25:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:39,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116025298] [2024-09-11 20:25:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:39,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:39,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:39,428 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:39,456 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:25:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:39,503 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-09-11 20:25:39,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:39,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116025298] [2024-09-11 20:25:39,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116025298] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:39,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194066694] [2024-09-11 20:25:39,527 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:25:39,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:39,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:39,529 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:39,531 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-09-11 20:25:39,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:25:39,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:39,611 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-11 20:25:39,613 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-11 20:25:39,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 20:25:40,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194066694] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:40,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:40,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 22 [2024-09-11 20:25:40,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110165340] [2024-09-11 20:25:40,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:40,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-11 20:25:40,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:40,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-11 20:25:40,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-11 20:25:40,286 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 19 states have internal predecessors, (56), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-11 20:25:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:40,510 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2024-09-11 20:25:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-11 20:25:40,510 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 19 states have internal predecessors, (56), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) Word has length 43 [2024-09-11 20:25:40,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:40,511 INFO L225 Difference]: With dead ends: 108 [2024-09-11 20:25:40,511 INFO L226 Difference]: Without dead ends: 104 [2024-09-11 20:25:40,511 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 76 SyntacticMatches, 9 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2024-09-11 20:25:40,512 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:40,512 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 248 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-11 20:25:40,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-09-11 20:25:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 88. [2024-09-11 20:25:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 11 states have call successors, (11), 4 states have call predecessors, (11), 16 states have return successors, (38), 23 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-11 20:25:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 115 transitions. [2024-09-11 20:25:40,537 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 115 transitions. Word has length 43 [2024-09-11 20:25:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:40,537 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 115 transitions. [2024-09-11 20:25:40,538 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 19 states have internal predecessors, (56), 9 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-11 20:25:40,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2024-09-11 20:25:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 20:25:40,539 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:40,539 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:40,551 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-09-11 20:25:40,742 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-11 20:25:40,742 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:40,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash 575852236, now seen corresponding path program 3 times [2024-09-11 20:25:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886263522] [2024-09-11 20:25:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:40,825 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:40,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:40,928 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:40,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-11 20:25:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,072 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:41,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886263522] [2024-09-11 20:25:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886263522] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45193296] [2024-09-11 20:25:41,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:25:41,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:41,106 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:41,108 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-09-11 20:25:41,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 20:25:41,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:41,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-11 20:25:41,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:41,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:43,167 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-11 20:25:43,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45193296] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:43,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:43,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20] total 41 [2024-09-11 20:25:43,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502866103] [2024-09-11 20:25:43,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:43,168 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-09-11 20:25:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-09-11 20:25:43,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1499, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 20:25:43,170 INFO L87 Difference]: Start difference. First operand 88 states and 115 transitions. Second operand has 41 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 30 states have internal predecessors, (80), 14 states have call successors, (16), 1 states have call predecessors, (16), 10 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2024-09-11 20:25:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:43,788 INFO L93 Difference]: Finished difference Result 177 states and 237 transitions. [2024-09-11 20:25:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-11 20:25:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 30 states have internal predecessors, (80), 14 states have call successors, (16), 1 states have call predecessors, (16), 10 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) Word has length 51 [2024-09-11 20:25:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:43,790 INFO L225 Difference]: With dead ends: 177 [2024-09-11 20:25:43,790 INFO L226 Difference]: Without dead ends: 173 [2024-09-11 20:25:43,791 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 85 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=390, Invalid=2690, Unknown=0, NotChecked=0, Total=3080 [2024-09-11 20:25:43,794 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 63 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:43,794 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 488 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:25:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-09-11 20:25:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 90. [2024-09-11 20:25:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.096774193548387) internal successors, (68), 60 states have internal predecessors, (68), 11 states have call successors, (11), 4 states have call predecessors, (11), 16 states have return successors, (38), 25 states have call predecessors, (38), 11 states have call successors, (38) [2024-09-11 20:25:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 117 transitions. [2024-09-11 20:25:43,827 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 117 transitions. Word has length 51 [2024-09-11 20:25:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:43,827 INFO L474 AbstractCegarLoop]: Abstraction has 90 states and 117 transitions. [2024-09-11 20:25:43,827 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 30 states have internal predecessors, (80), 14 states have call successors, (16), 1 states have call predecessors, (16), 10 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2024-09-11 20:25:43,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 117 transitions. [2024-09-11 20:25:43,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-09-11 20:25:43,829 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:43,829 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:43,845 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-11 20:25:44,029 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-09-11 20:25:44,029 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:44,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:44,030 INFO L85 PathProgramCache]: Analyzing trace with hash 610835820, now seen corresponding path program 4 times [2024-09-11 20:25:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:44,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445950058] [2024-09-11 20:25:44,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:44,108 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:44,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:44,202 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:44,273 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:44,292 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-11 20:25:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:44,335 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:25:44,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445950058] [2024-09-11 20:25:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445950058] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999638176] [2024-09-11 20:25:44,359 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:25:44,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:44,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:44,361 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:44,363 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-09-11 20:25:44,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:25:44,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:44,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-11 20:25:44,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:44,754 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:44,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:25:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-11 20:25:45,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999638176] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:25:45,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:25:45,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20] total 36 [2024-09-11 20:25:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765333378] [2024-09-11 20:25:45,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:25:45,957 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-11 20:25:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:25:45,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-11 20:25:45,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2024-09-11 20:25:45,958 INFO L87 Difference]: Start difference. First operand 90 states and 117 transitions. Second operand has 36 states, 33 states have (on average 2.272727272727273) internal successors, (75), 27 states have internal predecessors, (75), 13 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-11 20:25:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:25:46,474 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2024-09-11 20:25:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-11 20:25:46,475 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.272727272727273) internal successors, (75), 27 states have internal predecessors, (75), 13 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) Word has length 51 [2024-09-11 20:25:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:25:46,476 INFO L225 Difference]: With dead ends: 131 [2024-09-11 20:25:46,476 INFO L226 Difference]: Without dead ends: 127 [2024-09-11 20:25:46,477 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 85 SyntacticMatches, 7 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2024-09-11 20:25:46,478 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-11 20:25:46,478 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 327 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-11 20:25:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-09-11 20:25:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 69. [2024-09-11 20:25:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 10 states have call successors, (10), 4 states have call predecessors, (10), 11 states have return successors, (22), 15 states have call predecessors, (22), 10 states have call successors, (22) [2024-09-11 20:25:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2024-09-11 20:25:46,499 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 51 [2024-09-11 20:25:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:25:46,499 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2024-09-11 20:25:46,500 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.272727272727273) internal successors, (75), 27 states have internal predecessors, (75), 13 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (16), 11 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-11 20:25:46,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2024-09-11 20:25:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:25:46,501 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:25:46,501 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:25:46,518 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-11 20:25:46,705 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:46,706 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:25:46,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:25:46,706 INFO L85 PathProgramCache]: Analyzing trace with hash -755482820, now seen corresponding path program 5 times [2024-09-11 20:25:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:25:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129046981] [2024-09-11 20:25:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:25:46,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:25:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:46,868 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:46,914 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:46,968 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:25:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:47,001 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:25:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:47,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:47,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:25:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:25:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:47,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:25:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129046981] [2024-09-11 20:25:47,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129046981] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:25:47,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928415152] [2024-09-11 20:25:47,121 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-11 20:25:47,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:25:47,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:25:47,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:25:47,124 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-09-11 20:25:47,233 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-09-11 20:25:47,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:25:47,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-11 20:25:47,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:25:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-11 20:25:47,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928415152] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:18,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-11 20:28:18,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2024-09-11 20:28:18,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274897583] [2024-09-11 20:28:18,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:18,685 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-11 20:28:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:18,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-11 20:28:18,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=641, Unknown=34, NotChecked=0, Total=756 [2024-09-11 20:28:18,686 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-11 20:28:20,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:20,537 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2024-09-11 20:28:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-11 20:28:20,538 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 50 [2024-09-11 20:28:20,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:20,538 INFO L225 Difference]: With dead ends: 96 [2024-09-11 20:28:20,538 INFO L226 Difference]: Without dead ends: 92 [2024-09-11 20:28:20,539 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 150.8s TimeCoverageRelationStatistics Valid=137, Invalid=951, Unknown=34, NotChecked=0, Total=1122 [2024-09-11 20:28:20,540 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:20,540 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 344 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-09-11 20:28:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-11 20:28:20,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 72. [2024-09-11 20:28:20,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (24), 16 states have call predecessors, (24), 10 states have call successors, (24) [2024-09-11 20:28:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2024-09-11 20:28:20,566 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 50 [2024-09-11 20:28:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:20,567 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2024-09-11 20:28:20,567 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 8 states have call successors, (8), 1 states have call predecessors, (8), 8 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-11 20:28:20,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2024-09-11 20:28:20,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-11 20:28:20,568 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:20,568 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:20,586 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-09-11 20:28:20,769 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:20,769 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:20,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:20,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1085273852, now seen corresponding path program 6 times [2024-09-11 20:28:20,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:20,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22890388] [2024-09-11 20:28:20,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:20,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:20,962 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:21,197 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:21,384 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:21,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-09-11 20:28:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:21,817 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,038 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-11 20:28:22,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22890388] [2024-09-11 20:28:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22890388] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:22,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670886794] [2024-09-11 20:28:22,276 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-11 20:28:22,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:22,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:22,277 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:22,278 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-09-11 20:28:22,381 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-09-11 20:28:22,381 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:22,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-11 20:28:22,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-11 20:28:23,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-09-11 20:28:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670886794] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:27,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:27,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 34 [2024-09-11 20:28:27,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074775496] [2024-09-11 20:28:27,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:27,612 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-11 20:28:27,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:27,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-11 20:28:27,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2024-09-11 20:28:27,613 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 34 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (16), 9 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-11 20:28:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:29,546 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2024-09-11 20:28:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:28:29,546 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (16), 9 states have call predecessors, (16), 13 states have call successors, (16) Word has length 50 [2024-09-11 20:28:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:29,548 INFO L225 Difference]: With dead ends: 90 [2024-09-11 20:28:29,548 INFO L226 Difference]: Without dead ends: 81 [2024-09-11 20:28:29,548 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 83 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=200, Invalid=1440, Unknown=0, NotChecked=0, Total=1640 [2024-09-11 20:28:29,549 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:29,549 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 358 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-09-11 20:28:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-11 20:28:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2024-09-11 20:28:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.12) internal successors, (56), 51 states have internal predecessors, (56), 10 states have call successors, (10), 4 states have call predecessors, (10), 12 states have return successors, (24), 17 states have call predecessors, (24), 10 states have call successors, (24) [2024-09-11 20:28:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2024-09-11 20:28:29,577 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 50 [2024-09-11 20:28:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:29,577 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-09-11 20:28:29,578 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 13 states have call successors, (15), 1 states have call predecessors, (15), 8 states have return successors, (16), 9 states have call predecessors, (16), 13 states have call successors, (16) [2024-09-11 20:28:29,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2024-09-11 20:28:29,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-11 20:28:29,579 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:29,579 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:29,595 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-09-11 20:28:29,779 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:29,780 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:29,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:29,780 INFO L85 PathProgramCache]: Analyzing trace with hash -356268368, now seen corresponding path program 7 times [2024-09-11 20:28:29,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:29,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048670657] [2024-09-11 20:28:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:29,933 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,083 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,253 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-11 20:28:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:30,841 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,055 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-09-11 20:28:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048670657] [2024-09-11 20:28:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048670657] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:31,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904112347] [2024-09-11 20:28:31,251 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-11 20:28:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:31,253 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:31,255 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-09-11 20:28:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:31,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 20:28:31,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-11 20:28:32,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-11 20:28:37,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904112347] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:37,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:37,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 28 [2024-09-11 20:28:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650873057] [2024-09-11 20:28:37,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:37,764 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-11 20:28:37,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:37,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-11 20:28:37,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2024-09-11 20:28:37,767 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2024-09-11 20:28:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:39,783 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2024-09-11 20:28:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:28:39,784 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) Word has length 58 [2024-09-11 20:28:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:39,786 INFO L225 Difference]: With dead ends: 103 [2024-09-11 20:28:39,786 INFO L226 Difference]: Without dead ends: 99 [2024-09-11 20:28:39,787 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2024-09-11 20:28:39,787 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:39,788 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 351 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-09-11 20:28:39,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-11 20:28:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 80. [2024-09-11 20:28:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 states have internal predecessors, (61), 10 states have call successors, (10), 4 states have call predecessors, (10), 14 states have return successors, (30), 20 states have call predecessors, (30), 10 states have call successors, (30) [2024-09-11 20:28:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 101 transitions. [2024-09-11 20:28:39,822 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 101 transitions. Word has length 58 [2024-09-11 20:28:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:39,822 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 101 transitions. [2024-09-11 20:28:39,822 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 23 states have internal predecessors, (70), 12 states have call successors, (14), 1 states have call predecessors, (14), 8 states have return successors, (17), 8 states have call predecessors, (17), 12 states have call successors, (17) [2024-09-11 20:28:39,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 101 transitions. [2024-09-11 20:28:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-11 20:28:39,823 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:39,823 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:39,840 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-09-11 20:28:40,024 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-11 20:28:40,024 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:40,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1994498224, now seen corresponding path program 4 times [2024-09-11 20:28:40,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:40,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925605954] [2024-09-11 20:28:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:40,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:40,170 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:40,318 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:40,578 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:40,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:40,849 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-11 20:28:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:41,040 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:41,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-11 20:28:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:28:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925605954] [2024-09-11 20:28:41,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925605954] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:28:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117870491] [2024-09-11 20:28:41,224 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-11 20:28:41,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:41,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:28:41,226 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:28:41,227 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-09-11 20:28:41,345 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-11 20:28:41,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:28:41,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-11 20:28:41,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:28:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-09-11 20:28:42,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:28:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-11 20:28:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117870491] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:28:53,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:28:53,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 22] total 48 [2024-09-11 20:28:53,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59564253] [2024-09-11 20:28:53,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:28:53,301 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-09-11 20:28:53,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:28:53,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-09-11 20:28:53,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2106, Unknown=0, NotChecked=0, Total=2256 [2024-09-11 20:28:53,303 INFO L87 Difference]: Start difference. First operand 80 states and 101 transitions. Second operand has 48 states, 43 states have (on average 2.116279069767442) internal successors, (91), 36 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (21), 15 states have call predecessors, (21), 18 states have call successors, (21) [2024-09-11 20:28:58,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:28:58,304 INFO L93 Difference]: Finished difference Result 115 states and 145 transitions. [2024-09-11 20:28:58,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-11 20:28:58,305 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 2.116279069767442) internal successors, (91), 36 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (21), 15 states have call predecessors, (21), 18 states have call successors, (21) Word has length 58 [2024-09-11 20:28:58,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:28:58,306 INFO L225 Difference]: With dead ends: 115 [2024-09-11 20:28:58,306 INFO L226 Difference]: Without dead ends: 111 [2024-09-11 20:28:58,307 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=288, Invalid=3018, Unknown=0, NotChecked=0, Total=3306 [2024-09-11 20:28:58,308 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 48 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-09-11 20:28:58,308 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 758 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-09-11 20:28:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-11 20:28:58,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 83. [2024-09-11 20:28:58,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 10 states have call successors, (10), 4 states have call predecessors, (10), 15 states have return successors, (33), 21 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-11 20:28:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2024-09-11 20:28:58,341 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 58 [2024-09-11 20:28:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:28:58,342 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2024-09-11 20:28:58,342 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 2.116279069767442) internal successors, (91), 36 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (21), 15 states have call predecessors, (21), 18 states have call successors, (21) [2024-09-11 20:28:58,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2024-09-11 20:28:58,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-11 20:28:58,343 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:28:58,343 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:28:58,356 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-09-11 20:28:58,544 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,17 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:28:58,544 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:28:58,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:28:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1978024976, now seen corresponding path program 8 times [2024-09-11 20:28:58,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:28:58,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034294446] [2024-09-11 20:28:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:28:58,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:28:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:58,691 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:58,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:59,112 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:59,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:28:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:59,582 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-11 20:28:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:59,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:28:59,922 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:28:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-11 20:29:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:29:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034294446] [2024-09-11 20:29:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034294446] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:29:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786855171] [2024-09-11 20:29:00,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-11 20:29:00,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:29:00,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:29:00,050 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:29:00,051 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-09-11 20:29:00,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-11 20:29:00,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:29:00,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-11 20:29:00,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:29:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 18 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-09-11 20:29:01,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:29:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-11 20:29:06,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786855171] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-11 20:29:06,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-11 20:29:06,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 30 [2024-09-11 20:29:06,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687826911] [2024-09-11 20:29:06,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-11 20:29:06,214 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-11 20:29:06,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-11 20:29:06,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-11 20:29:06,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2024-09-11 20:29:06,215 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 24 states have internal predecessors, (73), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (17), 9 states have call predecessors, (17), 12 states have call successors, (17) [2024-09-11 20:29:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-11 20:29:08,494 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2024-09-11 20:29:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-11 20:29:08,494 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 24 states have internal predecessors, (73), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (17), 9 states have call predecessors, (17), 12 states have call successors, (17) Word has length 58 [2024-09-11 20:29:08,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-11 20:29:08,495 INFO L225 Difference]: With dead ends: 112 [2024-09-11 20:29:08,495 INFO L226 Difference]: Without dead ends: 108 [2024-09-11 20:29:08,496 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-09-11 20:29:08,496 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 38 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-09-11 20:29:08,496 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 402 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-09-11 20:29:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-09-11 20:29:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2024-09-11 20:29:08,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 10 states have call successors, (10), 4 states have call predecessors, (10), 15 states have return successors, (33), 21 states have call predecessors, (33), 10 states have call successors, (33) [2024-09-11 20:29:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2024-09-11 20:29:08,529 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 58 [2024-09-11 20:29:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-11 20:29:08,529 INFO L474 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2024-09-11 20:29:08,529 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5172413793103448) internal successors, (73), 24 states have internal predecessors, (73), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (17), 9 states have call predecessors, (17), 12 states have call successors, (17) [2024-09-11 20:29:08,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:29:08,529 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2024-09-11 20:29:08,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-09-11 20:29:08,530 INFO L208 NwaCegarLoop]: Found error trace [2024-09-11 20:29:08,530 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-11 20:29:08,545 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-11 20:29:08,730 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:29:08,731 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-11 20:29:08,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-11 20:29:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 339795120, now seen corresponding path program 9 times [2024-09-11 20:29:08,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-11 20:29:08,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297277805] [2024-09-11 20:29:08,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-11 20:29:08,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-11 20:29:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:08,902 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:29:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:09,153 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:29:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:09,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:29:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:09,746 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-11 20:29:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:09,816 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-11 20:29:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:10,002 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:29:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:10,127 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-11 20:29:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-11 20:29:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-11 20:29:10,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-11 20:29:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297277805] [2024-09-11 20:29:10,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297277805] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-11 20:29:10,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324357107] [2024-09-11 20:29:10,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-11 20:29:10,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-11 20:29:10,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-11 20:29:10,240 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-11 20:29:10,241 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-09-11 20:29:10,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-11 20:29:10,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-11 20:29:10,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-11 20:29:10,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-11 20:29:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-11 20:29:12,325 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-11 20:29:36,795 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_gcd_#in~y1| |c_gcd_#in~y2|))) (and (forall ((v_gcd_~y1_BEFORE_CALL_65 Int)) (or (< (* (div |c_gcd_#t~ret5| 2) 3) (+ 2 (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_65 3)) 6))) (< v_gcd_~y1_BEFORE_CALL_65 .cse0))) (forall ((v_gcd_~y1_BEFORE_CALL_65 Int)) (or (< v_gcd_~y1_BEFORE_CALL_65 .cse0) (< (* 3 (div (+ (- 1) |c_gcd_#t~ret5|) 2)) (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_65 3)) 6)))) (forall ((v_gcd_~y1_BEFORE_CALL_65 Int) (v_y_104 Int)) (let ((.cse1 (* v_gcd_~y1_BEFORE_CALL_65 3))) (let ((.cse2 (div (+ (- 1) .cse1) 6))) (or (< (+ (* |c_gcd_#t~ret5| 3) 4) (+ (mod (+ 5 .cse1) 6) (* 6 v_y_104))) (< (* 3 v_y_104) .cse2) (< v_gcd_~y1_BEFORE_CALL_65 .cse0) (< (+ |c_gcd_#t~ret5| v_y_104) (+ .cse2 1)))))))) is different from false