./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/gcd02.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5189fb62 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 --procedureinliner.inline.calls.to.implemented.procedures NEVER --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-5189fb6-m [2024-09-13 03:10:09,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 03:10:09,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-13 03:10:09,132 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 03:10:09,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 03:10:09,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 03:10:09,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 03:10:09,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 03:10:09,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 03:10:09,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 03:10:09,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 03:10:09,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 03:10:09,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 03:10:09,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 03:10:09,152 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 03:10:09,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 03:10:09,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 03:10:09,153 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 03:10:09,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-13 03:10:09,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 03:10:09,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 03:10:09,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 03:10:09,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 03:10:09,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 03:10:09,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 03:10:09,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 03:10:09,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 03:10:09,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 03:10:09,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 03:10:09,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 03:10:09,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 03:10:09,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 03:10:09,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:10:09,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 03:10:09,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 03:10:09,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 03:10:09,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-13 03:10:09,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-13 03:10:09,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 03:10:09,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 03:10:09,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 03:10:09,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 03:10:09,158 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.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 03:10:09,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 03:10:09,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 03:10:09,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 03:10:09,371 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 03:10:09,373 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 03:10:09,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/gcd02.c [2024-09-13 03:10:10,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 03:10:10,753 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 03:10:10,753 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c [2024-09-13 03:10:10,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/2adfa0376/35a59c823a4048f696985588cec05c1f/FLAG452e23770 [2024-09-13 03:10:11,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/2adfa0376/35a59c823a4048f696985588cec05c1f [2024-09-13 03:10:11,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 03:10:11,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 03:10:11,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 03:10:11,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 03:10:11,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 03:10:11,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a88956f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11, skipping insertion in model container [2024-09-13 03:10:11,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 03:10:11,323 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-13 03:10:11,338 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-13 03:10:11,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:10:11,348 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 03:10:11,357 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-13 03:10:11,364 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-13 03:10:11,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:10:11,377 INFO L204 MainTranslator]: Completed translation [2024-09-13 03:10:11,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11 WrapperNode [2024-09-13 03:10:11,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 03:10:11,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 03:10:11,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 03:10:11,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 03:10:11,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,393 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 03:10:11,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 03:10:11,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 03:10:11,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 03:10:11,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 03:10:11,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,412 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-13 03:10:11,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,414 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 03:10:11,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 03:10:11,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 03:10:11,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 03:10:11,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (1/1) ... [2024-09-13 03:10:11,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:10:11,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:11,443 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-13 03:10:11,447 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-13 03:10:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 03:10:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-09-13 03:10:11,481 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-09-13 03:10:11,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 03:10:11,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 03:10:11,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-13 03:10:11,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-13 03:10:11,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 03:10:11,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 03:10:11,481 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2024-09-13 03:10:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2024-09-13 03:10:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 03:10:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 03:10:11,535 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 03:10:11,537 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 03:10:11,685 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-13 03:10:11,685 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 03:10:11,710 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 03:10:11,710 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 03:10:11,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:10:11 BoogieIcfgContainer [2024-09-13 03:10:11,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 03:10:11,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 03:10:11,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 03:10:11,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 03:10:11,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 03:10:11" (1/3) ... [2024-09-13 03:10:11,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd03e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:10:11, skipping insertion in model container [2024-09-13 03:10:11,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:10:11" (2/3) ... [2024-09-13 03:10:11,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd03e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:10:11, skipping insertion in model container [2024-09-13 03:10:11,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:10:11" (3/3) ... [2024-09-13 03:10:11,719 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2024-09-13 03:10:11,732 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 03:10:11,732 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-13 03:10:11,784 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 03:10:11,791 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;@7239c2ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 03:10:11,792 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-13 03:10:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:10:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 03:10:11,802 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:11,802 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:10:11,803 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:11,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1001653490, now seen corresponding path program 1 times [2024-09-13 03:10:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:11,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76971639] [2024-09-13 03:10:11,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:11,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,111 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,119 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-13 03:10:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76971639] [2024-09-13 03:10:12,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76971639] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:10:12,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:10:12,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 03:10:12,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536201469] [2024-09-13 03:10:12,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:10:12,126 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 03:10:12,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:12,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 03:10:12,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-13 03:10:12,145 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 26 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:10:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:12,246 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-09-13 03:10:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 03:10:12,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-13 03:10:12,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:12,255 INFO L225 Difference]: With dead ends: 85 [2024-09-13 03:10:12,256 INFO L226 Difference]: Without dead ends: 48 [2024-09-13 03:10:12,259 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-13 03:10:12,261 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:12,262 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 150 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:10:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-09-13 03:10:12,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-09-13 03:10:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 30 states have internal predecessors, (36), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 03:10:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-09-13 03:10:12,301 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 12 [2024-09-13 03:10:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:12,301 INFO L474 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-09-13 03:10:12,301 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:10:12,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-09-13 03:10:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 03:10:12,303 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:12,303 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:10:12,304 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-13 03:10:12,305 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:12,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2101058803, now seen corresponding path program 1 times [2024-09-13 03:10:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864688646] [2024-09-13 03:10:12,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,467 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,474 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-13 03:10:12,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:12,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864688646] [2024-09-13 03:10:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864688646] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:10:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:10:12,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-13 03:10:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142057708] [2024-09-13 03:10:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:10:12,476 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-13 03:10:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:12,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-13 03:10:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-13 03:10:12,477 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:10:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:12,591 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2024-09-13 03:10:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 03:10:12,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-13 03:10:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:12,593 INFO L225 Difference]: With dead ends: 68 [2024-09-13 03:10:12,593 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 03:10:12,594 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-13 03:10:12,595 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:12,595 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 111 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:10:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 03:10:12,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2024-09-13 03:10:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 03:10:12,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-09-13 03:10:12,612 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 17 [2024-09-13 03:10:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:12,612 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-09-13 03:10:12,613 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:10:12,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,613 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-09-13 03:10:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 03:10:12,614 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:12,614 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:10:12,614 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-13 03:10:12,615 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:12,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2098228658, now seen corresponding path program 1 times [2024-09-13 03:10:12,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:12,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780435611] [2024-09-13 03:10:12,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,701 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,707 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-13 03:10:12,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:12,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780435611] [2024-09-13 03:10:12,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780435611] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:10:12,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:10:12,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 03:10:12,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647445946] [2024-09-13 03:10:12,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:10:12,711 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 03:10:12,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 03:10:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-13 03:10:12,712 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:10:12,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:12,820 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-09-13 03:10:12,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 03:10:12,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-13 03:10:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:12,824 INFO L225 Difference]: With dead ends: 66 [2024-09-13 03:10:12,824 INFO L226 Difference]: Without dead ends: 64 [2024-09-13 03:10:12,825 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-09-13 03:10:12,826 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:12,826 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 146 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:10:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-13 03:10:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2024-09-13 03:10:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 03:10:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2024-09-13 03:10:12,845 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 17 [2024-09-13 03:10:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:12,845 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2024-09-13 03:10:12,845 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:10:12,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2024-09-13 03:10:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 03:10:12,846 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:12,847 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:10:12,847 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-13 03:10:12,847 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:12,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1634934741, now seen corresponding path program 1 times [2024-09-13 03:10:12,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:12,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000582920] [2024-09-13 03:10:12,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:12,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,890 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,893 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 03:10:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:12,912 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-13 03:10:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000582920] [2024-09-13 03:10:12,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000582920] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:10:12,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:10:12,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-13 03:10:12,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601704227] [2024-09-13 03:10:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:10:12,914 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-13 03:10:12,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:12,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-13 03:10:12,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-13 03:10:12,915 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 03:10:12,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:12,930 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2024-09-13 03:10:12,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-13 03:10:12,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-09-13 03:10:12,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:12,935 INFO L225 Difference]: With dead ends: 58 [2024-09-13 03:10:12,935 INFO L226 Difference]: Without dead ends: 54 [2024-09-13 03:10:12,935 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-13 03:10:12,936 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 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-13 03:10:12,936 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:10:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-09-13 03:10:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-09-13 03:10:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 37 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-13 03:10:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2024-09-13 03:10:12,951 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 23 [2024-09-13 03:10:12,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:12,953 INFO L474 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2024-09-13 03:10:12,953 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-13 03:10:12,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,954 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2024-09-13 03:10:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-13 03:10:12,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:12,955 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:10:12,955 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-13 03:10:12,955 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:12,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -146564981, now seen corresponding path program 1 times [2024-09-13 03:10:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:12,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207417476] [2024-09-13 03:10:12,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,018 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 03:10:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,119 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-13 03:10:13,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:13,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207417476] [2024-09-13 03:10:13,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207417476] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:10:13,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:10:13,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-13 03:10:13,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707299877] [2024-09-13 03:10:13,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:10:13,122 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-13 03:10:13,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:13,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-13 03:10:13,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-13 03:10:13,124 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 03:10:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:13,322 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2024-09-13 03:10:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-13 03:10:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-09-13 03:10:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:13,323 INFO L225 Difference]: With dead ends: 72 [2024-09-13 03:10:13,323 INFO L226 Difference]: Without dead ends: 68 [2024-09-13 03:10:13,324 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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-13 03:10:13,324 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:13,324 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 157 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:10:13,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-13 03:10:13,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-09-13 03:10:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-09-13 03:10:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2024-09-13 03:10:13,347 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 24 [2024-09-13 03:10:13,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:13,347 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2024-09-13 03:10:13,347 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 03:10:13,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2024-09-13 03:10:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 03:10:13,348 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:13,349 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, 1, 1, 1, 1] [2024-09-13 03:10:13,349 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-13 03:10:13,349 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:13,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:13,351 INFO L85 PathProgramCache]: Analyzing trace with hash -698589569, now seen corresponding path program 1 times [2024-09-13 03:10:13,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:13,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143539760] [2024-09-13 03:10:13,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:13,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,392 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,394 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 03:10:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:10:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,436 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-13 03:10:13,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:13,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143539760] [2024-09-13 03:10:13,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143539760] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:10:13,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:10:13,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 03:10:13,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886143223] [2024-09-13 03:10:13,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:10:13,437 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 03:10:13,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:13,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 03:10:13,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 03:10:13,438 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 03:10:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:13,465 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2024-09-13 03:10:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 03:10:13,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 30 [2024-09-13 03:10:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:13,466 INFO L225 Difference]: With dead ends: 67 [2024-09-13 03:10:13,466 INFO L226 Difference]: Without dead ends: 58 [2024-09-13 03:10:13,467 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-13 03:10:13,467 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 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-13 03:10:13,467 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:10:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-13 03:10:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-09-13 03:10:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-13 03:10:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2024-09-13 03:10:13,485 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 30 [2024-09-13 03:10:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:13,486 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2024-09-13 03:10:13,486 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 03:10:13,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2024-09-13 03:10:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 03:10:13,487 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:13,493 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, 1, 1, 1] [2024-09-13 03:10:13,493 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-13 03:10:13,494 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:13,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:13,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1845010923, now seen corresponding path program 1 times [2024-09-13 03:10:13,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:13,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280189894] [2024-09-13 03:10:13,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:13,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,555 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,557 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,574 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-13 03:10:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,610 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:10:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,673 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-13 03:10:13,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280189894] [2024-09-13 03:10:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280189894] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:10:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993026723] [2024-09-13 03:10:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:13,676 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-13 03:10:13,678 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-13 03:10:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:13,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-13 03:10:13,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:10:13,836 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-13 03:10:13,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:10:13,986 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-13 03:10:13,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993026723] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:10:13,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:10:13,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2024-09-13 03:10:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646921484] [2024-09-13 03:10:13,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:10:13,987 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-13 03:10:13,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-13 03:10:13,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-09-13 03:10:13,988 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-13 03:10:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:14,159 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2024-09-13 03:10:14,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 03:10:14,160 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 31 [2024-09-13 03:10:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:14,161 INFO L225 Difference]: With dead ends: 66 [2024-09-13 03:10:14,161 INFO L226 Difference]: Without dead ends: 58 [2024-09-13 03:10:14,161 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 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-13 03:10:14,162 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 15 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:14,162 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 158 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:10:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-09-13 03:10:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2024-09-13 03:10:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 03:10:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2024-09-13 03:10:14,175 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 31 [2024-09-13 03:10:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:14,175 INFO L474 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2024-09-13 03:10:14,175 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-13 03:10:14,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2024-09-13 03:10:14,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 03:10:14,176 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:14,176 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, 1, 1, 1, 1] [2024-09-13 03:10:14,191 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-13 03:10:14,377 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-13 03:10:14,377 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:14,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:14,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2081598593, now seen corresponding path program 1 times [2024-09-13 03:10:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215461470] [2024-09-13 03:10:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,436 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,440 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,497 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,513 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 03:10:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,556 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-13 03:10:14,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:14,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215461470] [2024-09-13 03:10:14,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215461470] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:10:14,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:10:14,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-13 03:10:14,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002930313] [2024-09-13 03:10:14,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:10:14,557 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 03:10:14,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:14,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 03:10:14,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-13 03:10:14,557 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 03:10:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:14,698 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2024-09-13 03:10:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-13 03:10:14,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2024-09-13 03:10:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:14,700 INFO L225 Difference]: With dead ends: 77 [2024-09-13 03:10:14,700 INFO L226 Difference]: Without dead ends: 73 [2024-09-13 03:10:14,700 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 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-13 03:10:14,701 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:14,701 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 161 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:10:14,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-09-13 03:10:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2024-09-13 03:10:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2024-09-13 03:10:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-09-13 03:10:14,721 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 32 [2024-09-13 03:10:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:14,722 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-09-13 03:10:14,722 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-09-13 03:10:14,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-09-13 03:10:14,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-13 03:10:14,723 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:14,723 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, 1, 1, 1, 1] [2024-09-13 03:10:14,723 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-13 03:10:14,723 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:14,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1569823201, now seen corresponding path program 1 times [2024-09-13 03:10:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627224202] [2024-09-13 03:10:14,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:14,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,761 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,764 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,821 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 03:10:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,853 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-13 03:10:14,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627224202] [2024-09-13 03:10:14,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627224202] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:10:14,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247835778] [2024-09-13 03:10:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:14,856 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-13 03:10:14,857 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-13 03:10:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:14,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 03:10:14,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:10:14,982 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-13 03:10:14,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:10:15,296 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-13 03:10:15,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247835778] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:10:15,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:10:15,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-09-13 03:10:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872466056] [2024-09-13 03:10:15,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:10:15,297 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 03:10:15,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:15,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 03:10:15,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-09-13 03:10:15,298 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-13 03:10:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:15,511 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2024-09-13 03:10:15,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 03:10:15,512 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 32 [2024-09-13 03:10:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:15,513 INFO L225 Difference]: With dead ends: 85 [2024-09-13 03:10:15,513 INFO L226 Difference]: Without dead ends: 81 [2024-09-13 03:10:15,513 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-09-13 03:10:15,514 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:15,514 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 256 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:10:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-13 03:10:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66. [2024-09-13 03:10:15,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) [2024-09-13 03:10:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 82 transitions. [2024-09-13 03:10:15,534 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 82 transitions. Word has length 32 [2024-09-13 03:10:15,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:15,534 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 82 transitions. [2024-09-13 03:10:15,535 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 17 states have internal predecessors, (41), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-09-13 03:10:15,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:15,535 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 82 transitions. [2024-09-13 03:10:15,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 03:10:15,537 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:15,537 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, 1, 1, 1, 1] [2024-09-13 03:10:15,549 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-13 03:10:15,741 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:15,742 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:15,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1637323657, now seen corresponding path program 1 times [2024-09-13 03:10:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:15,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918527005] [2024-09-13 03:10:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:15,809 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:15,812 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:15,837 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:15,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 03:10:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:15,881 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:10:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:15,951 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-13 03:10:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918527005] [2024-09-13 03:10:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918527005] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:10:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053906581] [2024-09-13 03:10:15,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:15,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:15,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:15,953 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-13 03:10:15,954 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-13 03:10:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:15,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-13 03:10:15,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:10:16,039 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-13 03:10:16,039 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:10:16,152 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-13 03:10:16,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053906581] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:10:16,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:10:16,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-09-13 03:10:16,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362451184] [2024-09-13 03:10:16,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:10:16,153 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-13 03:10:16,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:16,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-13 03:10:16,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-09-13 03:10:16,154 INFO L87 Difference]: Start difference. First operand 66 states and 82 transitions. Second operand has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-13 03:10:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:16,299 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-09-13 03:10:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 03:10:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2024-09-13 03:10:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:16,300 INFO L225 Difference]: With dead ends: 81 [2024-09-13 03:10:16,300 INFO L226 Difference]: Without dead ends: 72 [2024-09-13 03:10:16,301 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 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-13 03:10:16,301 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:16,301 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 184 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:10:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-09-13 03:10:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2024-09-13 03:10:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2024-09-13 03:10:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2024-09-13 03:10:16,314 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 39 [2024-09-13 03:10:16,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:16,314 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2024-09-13 03:10:16,314 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 5 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-13 03:10:16,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2024-09-13 03:10:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 03:10:16,316 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:16,317 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, 1, 1, 1, 1] [2024-09-13 03:10:16,329 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-13 03:10:16,520 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-13 03:10:16,521 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:16,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:16,522 INFO L85 PathProgramCache]: Analyzing trace with hash 514532823, now seen corresponding path program 1 times [2024-09-13 03:10:16,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:16,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154293019] [2024-09-13 03:10:16,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:16,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:16,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:16,573 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:16,602 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:16,628 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 03:10:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:16,667 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:10:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:16,686 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-13 03:10:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:16,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154293019] [2024-09-13 03:10:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154293019] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:10:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908974945] [2024-09-13 03:10:16,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:16,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:16,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:16,688 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-13 03:10:16,689 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-13 03:10:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:16,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-13 03:10:16,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:10:16,832 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-13 03:10:16,832 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:10:17,298 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-13 03:10:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908974945] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:10:17,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:10:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 21 [2024-09-13 03:10:17,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067974] [2024-09-13 03:10:17,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:10:17,299 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 03:10:17,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 03:10:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-09-13 03:10:17,300 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-13 03:10:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:17,525 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-09-13 03:10:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 03:10:17,525 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) Word has length 39 [2024-09-13 03:10:17,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:17,526 INFO L225 Difference]: With dead ends: 91 [2024-09-13 03:10:17,526 INFO L226 Difference]: Without dead ends: 87 [2024-09-13 03:10:17,527 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2024-09-13 03:10:17,528 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:17,528 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 255 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:10:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-13 03:10:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2024-09-13 03:10:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 51 states have internal predecessors, (55), 13 states have call successors, (13), 6 states have call predecessors, (13), 12 states have return successors, (27), 17 states have call predecessors, (27), 12 states have call successors, (27) [2024-09-13 03:10:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2024-09-13 03:10:17,545 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 39 [2024-09-13 03:10:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:17,546 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2024-09-13 03:10:17,546 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 19 states have internal predecessors, (52), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-13 03:10:17,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2024-09-13 03:10:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-09-13 03:10:17,549 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:17,549 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, 1, 1, 1, 1] [2024-09-13 03:10:17,561 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-09-13 03:10:17,751 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-13 03:10:17,751 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:17,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:17,752 INFO L85 PathProgramCache]: Analyzing trace with hash 813588075, now seen corresponding path program 1 times [2024-09-13 03:10:17,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:17,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465668644] [2024-09-13 03:10:17,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:17,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:17,810 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:17,813 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:17,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:17,896 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:17,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:10:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:17,944 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-13 03:10:17,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465668644] [2024-09-13 03:10:17,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465668644] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:10:17,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618480607] [2024-09-13 03:10:17,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:17,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:17,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:17,946 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-13 03:10:17,948 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-13 03:10:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:17,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-09-13 03:10:17,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:10:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-13 03:10:18,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:10:18,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:10:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618480607] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:10:18,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:10:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 22 [2024-09-13 03:10:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988925201] [2024-09-13 03:10:18,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:10:18,521 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-13 03:10:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-13 03:10:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-09-13 03:10:18,522 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 22 states, 20 states have (on average 2.45) internal successors, (49), 17 states have internal predecessors, (49), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-13 03:10:18,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:18,768 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2024-09-13 03:10:18,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 03:10:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.45) internal successors, (49), 17 states have internal predecessors, (49), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) Word has length 40 [2024-09-13 03:10:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:18,771 INFO L225 Difference]: With dead ends: 84 [2024-09-13 03:10:18,771 INFO L226 Difference]: Without dead ends: 80 [2024-09-13 03:10:18,771 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2024-09-13 03:10:18,773 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:18,773 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 271 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:10:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-13 03:10:18,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2024-09-13 03:10:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (20), 14 states have call predecessors, (20), 11 states have call successors, (20) [2024-09-13 03:10:18,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2024-09-13 03:10:18,788 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 40 [2024-09-13 03:10:18,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:18,789 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-09-13 03:10:18,789 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.45) internal successors, (49), 17 states have internal predecessors, (49), 9 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 7 states have call predecessors, (11), 9 states have call successors, (11) [2024-09-13 03:10:18,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:18,789 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2024-09-13 03:10:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-13 03:10:18,791 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:18,791 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, 1, 1, 1, 1] [2024-09-13 03:10:18,811 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-13 03:10:18,995 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-13 03:10:18,997 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:18,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1812824075, now seen corresponding path program 1 times [2024-09-13 03:10:18,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:18,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81747105] [2024-09-13 03:10:18,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,069 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,109 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,143 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,164 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:10:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,200 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:10:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,223 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-13 03:10:19,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:19,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81747105] [2024-09-13 03:10:19,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81747105] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:10:19,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807917520] [2024-09-13 03:10:19,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:19,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:19,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:19,225 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-13 03:10:19,226 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-13 03:10:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:19,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-13 03:10:19,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:10:19,407 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-13 03:10:19,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:10:20,016 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-13 03:10:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807917520] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:10:20,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:10:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 22 [2024-09-13 03:10:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356403822] [2024-09-13 03:10:20,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:10:20,018 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-13 03:10:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:10:20,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-13 03:10:20,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-13 03:10:20,019 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 9 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-13 03:10:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:10:20,247 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2024-09-13 03:10:20,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-13 03:10:20,247 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 9 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) Word has length 47 [2024-09-13 03:10:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:10:20,248 INFO L225 Difference]: With dead ends: 90 [2024-09-13 03:10:20,248 INFO L226 Difference]: Without dead ends: 86 [2024-09-13 03:10:20,249 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 87 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-13 03:10:20,249 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 34 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:10:20,249 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 256 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:10:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-13 03:10:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2024-09-13 03:10:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 12 states have call successors, (12), 6 states have call predecessors, (12), 11 states have return successors, (23), 17 states have call predecessors, (23), 11 states have call successors, (23) [2024-09-13 03:10:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2024-09-13 03:10:20,264 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 47 [2024-09-13 03:10:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:10:20,264 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2024-09-13 03:10:20,264 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 19 states have internal predecessors, (57), 9 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (12), 6 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-13 03:10:20,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2024-09-13 03:10:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 03:10:20,265 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:10:20,266 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, 1, 1, 1, 1] [2024-09-13 03:10:20,286 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-13 03:10:20,466 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-13 03:10:20,467 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:10:20,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:10:20,467 INFO L85 PathProgramCache]: Analyzing trace with hash -740789303, now seen corresponding path program 2 times [2024-09-13 03:10:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:10:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509629851] [2024-09-13 03:10:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:10:20,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:10:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:10:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:10:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,579 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,626 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:10:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,653 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:10:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:10:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:10:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:10:20,745 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-13 03:10:20,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:10:20,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509629851] [2024-09-13 03:10:20,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509629851] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:10:20,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250130369] [2024-09-13 03:10:20,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:10:20,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:10:20,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:10:20,747 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-13 03:10:20,748 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-13 03:10:20,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:10:20,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:10:20,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-13 03:10:20,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:10:20,972 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-13 03:10:20,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:10:34,287 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_gcd_#in~y1| |c_gcd_#in~y2|))) (and (forall ((v_gcd_~y1_BEFORE_CALL_17 Int) (v_y_7 Int)) (let ((.cse1 (* v_gcd_~y1_BEFORE_CALL_17 3))) (let ((.cse0 (div (+ (- 1) .cse1) 6))) (or (< (+ |c_gcd_#t~ret5| v_y_7) (+ .cse0 1)) (< (* 3 v_y_7) .cse0) (< (+ (* |c_gcd_#t~ret5| 3) 4) (+ (* 6 v_y_7) (mod (+ 5 .cse1) 6))) (< v_gcd_~y1_BEFORE_CALL_17 .cse2))))) (forall ((v_gcd_~y1_BEFORE_CALL_17 Int)) (or (< (* 3 (div (+ (- 1) |c_gcd_#t~ret5|) 2)) (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_17 3)) 6)) (< v_gcd_~y1_BEFORE_CALL_17 .cse2))) (forall ((v_gcd_~y1_BEFORE_CALL_17 Int)) (or (< v_gcd_~y1_BEFORE_CALL_17 .cse2) (< (* (div |c_gcd_#t~ret5| 2) 3) (+ 2 (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_17 3)) 6))))))) is different from false [2024-09-13 03:11:31,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250130369] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:31,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:11:31,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2024-09-13 03:11:31,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124380296] [2024-09-13 03:11:31,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:11:31,738 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 03:11:31,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:11:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 03:11:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=614, Unknown=13, NotChecked=50, Total=756 [2024-09-13 03:11:31,739 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-13 03:11:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:11:32,520 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2024-09-13 03:11:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 03:11:32,521 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 54 [2024-09-13 03:11:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:11:32,521 INFO L225 Difference]: With dead ends: 102 [2024-09-13 03:11:32,522 INFO L226 Difference]: Without dead ends: 98 [2024-09-13 03:11:32,522 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 79 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 69.9s TimeCoverageRelationStatistics Valid=134, Invalid=913, Unknown=13, NotChecked=62, Total=1122 [2024-09-13 03:11:32,523 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 23 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 03:11:32,523 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 447 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 03:11:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-09-13 03:11:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2024-09-13 03:11:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 57 states have internal predecessors, (62), 13 states have call successors, (13), 6 states have call predecessors, (13), 15 states have return successors, (34), 21 states have call predecessors, (34), 12 states have call successors, (34) [2024-09-13 03:11:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2024-09-13 03:11:32,542 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 54 [2024-09-13 03:11:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:11:32,542 INFO L474 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2024-09-13 03:11:32,542 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2024-09-13 03:11:32,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2024-09-13 03:11:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-09-13 03:11:32,543 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:11:32,543 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, 1, 1, 1, 1] [2024-09-13 03:11:32,557 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-13 03:11:32,747 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-13 03:11:32,748 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:11:32,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1112627139, now seen corresponding path program 2 times [2024-09-13 03:11:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:11:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598604994] [2024-09-13 03:11:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:11:32,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:11:32,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:32,845 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:11:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:32,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:11:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:32,935 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:33,007 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-09-13 03:11:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:33,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:33,204 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:33,315 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-13 03:11:33,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:11:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598604994] [2024-09-13 03:11:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598604994] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360756705] [2024-09-13 03:11:33,315 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:11:33,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:11:33,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:11:33,317 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-13 03:11:33,318 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-13 03:11:33,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:11:33,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:11:33,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-13 03:11:33,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:11:33,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-13 03:11:33,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:11:34,449 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-13 03:11:34,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360756705] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:11:34,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:11:34,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 24 [2024-09-13 03:11:34,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141344227] [2024-09-13 03:11:34,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:11:34,450 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-13 03:11:34,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:11:34,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-13 03:11:34,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-09-13 03:11:34,451 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-13 03:11:35,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:11:35,151 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2024-09-13 03:11:35,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 03:11:35,151 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) Word has length 46 [2024-09-13 03:11:35,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:11:35,152 INFO L225 Difference]: With dead ends: 98 [2024-09-13 03:11:35,152 INFO L226 Difference]: Without dead ends: 89 [2024-09-13 03:11:35,153 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2024-09-13 03:11:35,153 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 03:11:35,153 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 239 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 03:11:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-09-13 03:11:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-09-13 03:11:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 57 states have internal predecessors, (61), 13 states have call successors, (13), 6 states have call predecessors, (13), 15 states have return successors, (33), 20 states have call predecessors, (33), 12 states have call successors, (33) [2024-09-13 03:11:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2024-09-13 03:11:35,166 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 46 [2024-09-13 03:11:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:11:35,166 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2024-09-13 03:11:35,166 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.409090909090909) internal successors, (53), 22 states have internal predecessors, (53), 8 states have call successors, (10), 1 states have call predecessors, (10), 9 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-09-13 03:11:35,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2024-09-13 03:11:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-13 03:11:35,167 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:11:35,167 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, 1, 1, 1, 1] [2024-09-13 03:11:35,179 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-13 03:11:35,367 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-13 03:11:35,367 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:11:35,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:35,368 INFO L85 PathProgramCache]: Analyzing trace with hash 409599947, now seen corresponding path program 3 times [2024-09-13 03:11:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:11:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860601322] [2024-09-13 03:11:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:11:35,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:11:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:35,443 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:11:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:35,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:11:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:35,517 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:35,673 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:35,704 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:11:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:35,791 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:35,839 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-13 03:11:35,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:11:35,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860601322] [2024-09-13 03:11:35,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860601322] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:35,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617452702] [2024-09-13 03:11:35,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 03:11:35,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:11:35,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:11:35,842 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-13 03:11:35,844 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-13 03:11:35,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 03:11:35,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:11:35,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-13 03:11:35,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:11:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:11:36,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:11:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:11:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617452702] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:11:37,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:11:37,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 34 [2024-09-13 03:11:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322611661] [2024-09-13 03:11:37,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:11:37,923 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-13 03:11:37,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:11:37,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-13 03:11:37,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2024-09-13 03:11:37,924 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 34 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 28 states have internal predecessors, (69), 12 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 9 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-13 03:11:39,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:11:39,004 INFO L93 Difference]: Finished difference Result 132 states and 176 transitions. [2024-09-13 03:11:39,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-09-13 03:11:39,005 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), 12 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 9 states have call predecessors, (14), 12 states have call successors, (14) Word has length 47 [2024-09-13 03:11:39,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:11:39,006 INFO L225 Difference]: With dead ends: 132 [2024-09-13 03:11:39,006 INFO L226 Difference]: Without dead ends: 128 [2024-09-13 03:11:39,006 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=239, Invalid=1653, Unknown=0, NotChecked=0, Total=1892 [2024-09-13 03:11:39,007 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 86 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-13 03:11:39,007 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 485 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-13 03:11:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-13 03:11:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 93. [2024-09-13 03:11:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.098360655737705) internal successors, (67), 63 states have internal predecessors, (67), 13 states have call successors, (13), 6 states have call predecessors, (13), 18 states have return successors, (41), 23 states have call predecessors, (41), 12 states have call successors, (41) [2024-09-13 03:11:39,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2024-09-13 03:11:39,023 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 47 [2024-09-13 03:11:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:11:39,023 INFO L474 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2024-09-13 03:11:39,023 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), 12 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 9 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-13 03:11:39,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:39,024 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2024-09-13 03:11:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-13 03:11:39,024 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:11:39,024 INFO L216 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-09-13 03:11:39,036 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-09-13 03:11:39,228 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-13 03:11:39,229 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:11:39,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash -315864469, now seen corresponding path program 3 times [2024-09-13 03:11:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:11:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172109629] [2024-09-13 03:11:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:11:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:11:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:39,293 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:11:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:39,295 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:11:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:39,371 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:39,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:39,549 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:11:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:39,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-13 03:11:39,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:11:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172109629] [2024-09-13 03:11:39,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172109629] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:39,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503022186] [2024-09-13 03:11:39,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 03:11:39,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:11:39,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:11:39,681 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-13 03:11:39,682 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-13 03:11:39,744 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-13 03:11:39,744 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:11:39,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-13 03:11:39,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:11:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:11:40,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:11:42,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-13 03:11:42,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503022186] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:11:42,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:11:42,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 36 [2024-09-13 03:11:42,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786248078] [2024-09-13 03:11:42,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:11:42,089 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-13 03:11:42,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:11:42,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-13 03:11:42,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2024-09-13 03:11:42,090 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 29 states have internal predecessors, (76), 14 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (15), 10 states have call predecessors, (15), 14 states have call successors, (15) [2024-09-13 03:11:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:11:43,030 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2024-09-13 03:11:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 03:11:43,030 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 29 states have internal predecessors, (76), 14 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (15), 10 states have call predecessors, (15), 14 states have call successors, (15) Word has length 47 [2024-09-13 03:11:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:11:43,031 INFO L225 Difference]: With dead ends: 115 [2024-09-13 03:11:43,031 INFO L226 Difference]: Without dead ends: 111 [2024-09-13 03:11:43,032 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2024-09-13 03:11:43,032 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 36 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 03:11:43,032 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 460 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 03:11:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-13 03:11:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2024-09-13 03:11:43,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 65 states have internal predecessors, (69), 13 states have call successors, (13), 6 states have call predecessors, (13), 19 states have return successors, (44), 24 states have call predecessors, (44), 12 states have call successors, (44) [2024-09-13 03:11:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2024-09-13 03:11:43,048 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 47 [2024-09-13 03:11:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:11:43,048 INFO L474 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2024-09-13 03:11:43,049 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.235294117647059) internal successors, (76), 29 states have internal predecessors, (76), 14 states have call successors, (16), 1 states have call predecessors, (16), 11 states have return successors, (15), 10 states have call predecessors, (15), 14 states have call successors, (15) [2024-09-13 03:11:43,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2024-09-13 03:11:43,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-09-13 03:11:43,050 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:11:43,050 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, 1, 1, 1, 1] [2024-09-13 03:11:43,062 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-13 03:11:43,253 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-13 03:11:43,254 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:11:43,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1839407255, now seen corresponding path program 4 times [2024-09-13 03:11:43,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:11:43,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259966509] [2024-09-13 03:11:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:11:43,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:11:43,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,323 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:11:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,325 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:11:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,398 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,445 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,585 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,620 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-13 03:11:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:43,749 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-13 03:11:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:11:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259966509] [2024-09-13 03:11:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259966509] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2867909] [2024-09-13 03:11:43,750 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 03:11:43,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:11:43,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:11:43,752 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-13 03:11:43,753 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-13 03:11:43,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 03:11:43,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:11:43,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-13 03:11:43,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:11:44,492 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-13 03:11:44,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:11:47,078 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-13 03:11:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2867909] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:11:47,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:11:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 20] total 36 [2024-09-13 03:11:47,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448038608] [2024-09-13 03:11:47,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:11:47,079 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-13 03:11:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:11:47,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-13 03:11:47,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1146, Unknown=0, NotChecked=0, Total=1260 [2024-09-13 03:11:47,080 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand has 36 states, 33 states have (on average 2.303030303030303) internal successors, (76), 27 states have internal predecessors, (76), 13 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-13 03:11:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:11:48,423 INFO L93 Difference]: Finished difference Result 126 states and 168 transitions. [2024-09-13 03:11:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-13 03:11:48,424 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.303030303030303) internal successors, (76), 27 states have internal predecessors, (76), 13 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) Word has length 55 [2024-09-13 03:11:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:11:48,425 INFO L225 Difference]: With dead ends: 126 [2024-09-13 03:11:48,425 INFO L226 Difference]: Without dead ends: 122 [2024-09-13 03:11:48,426 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 95 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=316, Invalid=2134, Unknown=0, NotChecked=0, Total=2450 [2024-09-13 03:11:48,426 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 44 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-13 03:11:48,426 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 459 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-13 03:11:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-09-13 03:11:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 75. [2024-09-13 03:11:48,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 6 states have call predecessors, (12), 13 states have return successors, (25), 16 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-13 03:11:48,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2024-09-13 03:11:48,452 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 55 [2024-09-13 03:11:48,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:11:48,452 INFO L474 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2024-09-13 03:11:48,452 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.303030303030303) internal successors, (76), 27 states have internal predecessors, (76), 13 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-13 03:11:48,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2024-09-13 03:11:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 03:11:48,453 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:11:48,453 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, 1, 1, 1, 1] [2024-09-13 03:11:48,466 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-13 03:11:48,654 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-13 03:11:48,654 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:11:48,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1099967369, now seen corresponding path program 5 times [2024-09-13 03:11:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:11:48,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750255546] [2024-09-13 03:11:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:11:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:11:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:48,724 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:11:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:48,726 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:11:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:48,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:48,877 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:48,920 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:11:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:49,003 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:49,110 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:49,195 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-13 03:11:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:11:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750255546] [2024-09-13 03:11:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750255546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277971820] [2024-09-13 03:11:49,195 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-13 03:11:49,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:11:49,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:11:49,197 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-13 03:11:49,197 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-13 03:11:49,270 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-09-13 03:11:49,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:11:49,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-13 03:11:49,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:11:49,820 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-13 03:11:49,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:11:52,054 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-13 03:11:52,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277971820] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:11:52,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:11:52,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 34 [2024-09-13 03:11:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329059781] [2024-09-13 03:11:52,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:11:52,055 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-13 03:11:52,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:11:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-13 03:11:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1010, Unknown=0, NotChecked=0, Total=1122 [2024-09-13 03:11:52,056 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 34 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 13 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-13 03:11:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:11:53,092 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2024-09-13 03:11:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 03:11:53,093 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 13 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) Word has length 54 [2024-09-13 03:11:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:11:53,093 INFO L225 Difference]: With dead ends: 92 [2024-09-13 03:11:53,093 INFO L226 Difference]: Without dead ends: 83 [2024-09-13 03:11:53,094 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 94 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=200, Invalid=1440, Unknown=0, NotChecked=0, Total=1640 [2024-09-13 03:11:53,094 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-09-13 03:11:53,094 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 399 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-09-13 03:11:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-09-13 03:11:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 76. [2024-09-13 03:11:53,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 12 states have call successors, (12), 6 states have call predecessors, (12), 13 states have return successors, (25), 17 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-13 03:11:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 93 transitions. [2024-09-13 03:11:53,108 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 93 transitions. Word has length 54 [2024-09-13 03:11:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:11:53,108 INFO L474 AbstractCegarLoop]: Abstraction has 76 states and 93 transitions. [2024-09-13 03:11:53,108 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.413793103448276) internal successors, (70), 28 states have internal predecessors, (70), 13 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2024-09-13 03:11:53,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2024-09-13 03:11:53,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-09-13 03:11:53,109 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:11:53,109 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, 1, 1, 1, 1] [2024-09-13 03:11:53,122 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-09-13 03:11:53,310 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-13 03:11:53,310 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:11:53,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:53,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2071268055, now seen corresponding path program 4 times [2024-09-13 03:11:53,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:11:53,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467184021] [2024-09-13 03:11:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:11:53,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:11:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,421 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:11:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,425 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:11:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,501 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,670 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:11:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,784 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,848 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:53,900 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-13 03:11:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:11:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467184021] [2024-09-13 03:11:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467184021] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:53,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591067282] [2024-09-13 03:11:53,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 03:11:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:11:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:11:53,903 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-13 03:11:53,906 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-13 03:11:53,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 03:11:53,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:11:53,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-13 03:11:53,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:11:54,426 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-13 03:11:54,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:11:56,310 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-13 03:11:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591067282] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:11:56,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:11:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18] total 27 [2024-09-13 03:11:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137194579] [2024-09-13 03:11:56,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:11:56,311 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 03:11:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:11:56,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 03:11:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2024-09-13 03:11:56,312 INFO L87 Difference]: Start difference. First operand 76 states and 93 transitions. Second operand has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-13 03:11:57,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:11:57,144 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2024-09-13 03:11:57,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-13 03:11:57,144 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) Word has length 54 [2024-09-13 03:11:57,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:11:57,145 INFO L225 Difference]: With dead ends: 100 [2024-09-13 03:11:57,145 INFO L226 Difference]: Without dead ends: 96 [2024-09-13 03:11:57,145 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-09-13 03:11:57,146 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 03:11:57,146 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 522 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 03:11:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-09-13 03:11:57,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2024-09-13 03:11:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 52 states have internal predecessors, (57), 12 states have call successors, (12), 6 states have call predecessors, (12), 13 states have return successors, (25), 18 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-13 03:11:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 94 transitions. [2024-09-13 03:11:57,161 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 94 transitions. Word has length 54 [2024-09-13 03:11:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:11:57,161 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 94 transitions. [2024-09-13 03:11:57,162 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 23 states have internal predecessors, (68), 12 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (15), 8 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-13 03:11:57,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 94 transitions. [2024-09-13 03:11:57,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-13 03:11:57,162 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:11:57,163 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, 1, 1, 1, 1] [2024-09-13 03:11:57,175 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-13 03:11:57,366 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-13 03:11:57,367 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:11:57,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:11:57,367 INFO L85 PathProgramCache]: Analyzing trace with hash -377988163, now seen corresponding path program 6 times [2024-09-13 03:11:57,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:11:57,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200803698] [2024-09-13 03:11:57,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:11:57,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:11:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,453 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:11:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:11:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,540 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,650 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,805 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:11:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,844 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-13 03:11:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,931 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:57,989 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:11:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:11:58,051 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-09-13 03:11:58,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:11:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200803698] [2024-09-13 03:11:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200803698] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:11:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165859360] [2024-09-13 03:11:58,052 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-13 03:11:58,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:11:58,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:11:58,054 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-13 03:11:58,056 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-13 03:11:58,143 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-09-13 03:11:58,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:11:58,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-13 03:11:58,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:11:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:11:58,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-13 03:12:02,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165859360] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:02,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:02,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 22] total 42 [2024-09-13 03:12:02,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214480447] [2024-09-13 03:12:02,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:02,254 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-09-13 03:12:02,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:02,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-09-13 03:12:02,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1590, Unknown=0, NotChecked=0, Total=1722 [2024-09-13 03:12:02,255 INFO L87 Difference]: Start difference. First operand 77 states and 94 transitions. Second operand has 42 states, 37 states have (on average 2.324324324324324) internal successors, (86), 33 states have internal predecessors, (86), 16 states have call successors, (18), 1 states have call predecessors, (18), 13 states have return successors, (20), 13 states have call predecessors, (20), 16 states have call successors, (20) [2024-09-13 03:12:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:03,750 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2024-09-13 03:12:03,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-13 03:12:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 2.324324324324324) internal successors, (86), 33 states have internal predecessors, (86), 16 states have call successors, (18), 1 states have call predecessors, (18), 13 states have return successors, (20), 13 states have call predecessors, (20), 16 states have call successors, (20) Word has length 62 [2024-09-13 03:12:03,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:03,751 INFO L225 Difference]: With dead ends: 139 [2024-09-13 03:12:03,751 INFO L226 Difference]: Without dead ends: 135 [2024-09-13 03:12:03,752 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 105 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=330, Invalid=2640, Unknown=0, NotChecked=0, Total=2970 [2024-09-13 03:12:03,752 INFO L434 NwaCegarLoop]: 34 mSDtfsCounter, 77 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:03,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 734 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-13 03:12:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-13 03:12:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 84. [2024-09-13 03:12:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 12 states have call successors, (12), 6 states have call predecessors, (12), 15 states have return successors, (31), 21 states have call predecessors, (31), 11 states have call successors, (31) [2024-09-13 03:12:03,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2024-09-13 03:12:03,773 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 62 [2024-09-13 03:12:03,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:03,774 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2024-09-13 03:12:03,774 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 2.324324324324324) internal successors, (86), 33 states have internal predecessors, (86), 16 states have call successors, (18), 1 states have call predecessors, (18), 13 states have return successors, (20), 13 states have call predecessors, (20), 16 states have call successors, (20) [2024-09-13 03:12:03,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:03,774 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2024-09-13 03:12:03,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-13 03:12:03,775 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:03,775 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, 1, 1, 1, 1] [2024-09-13 03:12:03,787 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-13 03:12:03,979 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-13 03:12:03,979 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:03,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:03,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1582685789, now seen corresponding path program 7 times [2024-09-13 03:12:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:03,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981943014] [2024-09-13 03:12:03,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:03,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,058 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,059 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,135 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,266 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-13 03:12:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,571 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,642 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,706 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-13 03:12:04,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:04,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981943014] [2024-09-13 03:12:04,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981943014] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:04,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529078802] [2024-09-13 03:12:04,707 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-13 03:12:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:04,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:04,708 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-13 03:12:04,710 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-13 03:12:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:04,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-09-13 03:12:04,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-09-13 03:12:05,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 41 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-13 03:12:10,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529078802] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:10,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:10,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 22] total 46 [2024-09-13 03:12:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162769760] [2024-09-13 03:12:10,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:10,037 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-09-13 03:12:10,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:10,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-09-13 03:12:10,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1906, Unknown=0, NotChecked=0, Total=2070 [2024-09-13 03:12:10,038 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 46 states, 42 states have (on average 2.142857142857143) internal successors, (90), 35 states have internal predecessors, (90), 17 states have call successors, (19), 1 states have call predecessors, (19), 14 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) [2024-09-13 03:12:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:12,034 INFO L93 Difference]: Finished difference Result 154 states and 200 transitions. [2024-09-13 03:12:12,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-13 03:12:12,035 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 2.142857142857143) internal successors, (90), 35 states have internal predecessors, (90), 17 states have call successors, (19), 1 states have call predecessors, (19), 14 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) Word has length 62 [2024-09-13 03:12:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:12,036 INFO L225 Difference]: With dead ends: 154 [2024-09-13 03:12:12,036 INFO L226 Difference]: Without dead ends: 150 [2024-09-13 03:12:12,037 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=386, Invalid=3036, Unknown=0, NotChecked=0, Total=3422 [2024-09-13 03:12:12,037 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:12,037 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 869 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-09-13 03:12:12,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-09-13 03:12:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 89. [2024-09-13 03:12:12,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.1) internal successors, (66), 58 states have internal predecessors, (66), 12 states have call successors, (12), 6 states have call predecessors, (12), 16 states have return successors, (34), 24 states have call predecessors, (34), 11 states have call successors, (34) [2024-09-13 03:12:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2024-09-13 03:12:12,060 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 62 [2024-09-13 03:12:12,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:12,060 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2024-09-13 03:12:12,061 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 2.142857142857143) internal successors, (90), 35 states have internal predecessors, (90), 17 states have call successors, (19), 1 states have call predecessors, (19), 14 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) [2024-09-13 03:12:12,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:12,061 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2024-09-13 03:12:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-13 03:12:12,061 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:12,061 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, 1, 1, 1, 1] [2024-09-13 03:12:12,073 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-09-13 03:12:12,264 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-13 03:12:12,264 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:12,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:12,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1743105565, now seen corresponding path program 8 times [2024-09-13 03:12:12,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031934457] [2024-09-13 03:12:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,345 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,412 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,542 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,688 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,719 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-13 03:12:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,828 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,889 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:12,943 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-13 03:12:12,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:12,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031934457] [2024-09-13 03:12:12,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031934457] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:12,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613395010] [2024-09-13 03:12:12,944 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:12:12,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:12,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:12,945 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-13 03:12:12,948 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-13 03:12:13,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:12:13,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:12:13,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-09-13 03:12:13,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:12:13,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-13 03:12:17,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613395010] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:17,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:17,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 23] total 50 [2024-09-13 03:12:17,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530184720] [2024-09-13 03:12:17,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:17,449 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-09-13 03:12:17,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:17,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-09-13 03:12:17,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2262, Unknown=0, NotChecked=0, Total=2450 [2024-09-13 03:12:17,450 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 50 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 39 states have internal predecessors, (90), 17 states have call successors, (19), 1 states have call predecessors, (19), 14 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) [2024-09-13 03:12:19,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:19,386 INFO L93 Difference]: Finished difference Result 148 states and 193 transitions. [2024-09-13 03:12:19,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-09-13 03:12:19,387 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 39 states have internal predecessors, (90), 17 states have call successors, (19), 1 states have call predecessors, (19), 14 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) Word has length 62 [2024-09-13 03:12:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:19,388 INFO L225 Difference]: With dead ends: 148 [2024-09-13 03:12:19,388 INFO L226 Difference]: Without dead ends: 144 [2024-09-13 03:12:19,389 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=514, Invalid=3908, Unknown=0, NotChecked=0, Total=4422 [2024-09-13 03:12:19,389 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 102 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:19,389 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 811 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-13 03:12:19,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-09-13 03:12:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 91. [2024-09-13 03:12:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.098360655737705) internal successors, (67), 60 states have internal predecessors, (67), 12 states have call successors, (12), 6 states have call predecessors, (12), 17 states have return successors, (37), 24 states have call predecessors, (37), 11 states have call successors, (37) [2024-09-13 03:12:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 116 transitions. [2024-09-13 03:12:19,421 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 116 transitions. Word has length 62 [2024-09-13 03:12:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:19,421 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 116 transitions. [2024-09-13 03:12:19,421 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 2.0930232558139537) internal successors, (90), 39 states have internal predecessors, (90), 17 states have call successors, (19), 1 states have call predecessors, (19), 14 states have return successors, (22), 15 states have call predecessors, (22), 17 states have call successors, (22) [2024-09-13 03:12:19,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 116 transitions. [2024-09-13 03:12:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-13 03:12:19,422 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:19,422 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, 1, 1, 1, 1] [2024-09-13 03:12:19,434 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-09-13 03:12:19,622 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-13 03:12:19,623 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:19,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash -913631875, now seen corresponding path program 9 times [2024-09-13 03:12:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:19,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563173193] [2024-09-13 03:12:19,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:19,703 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:19,706 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:19,782 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:19,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:19,963 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:20,033 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-13 03:12:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:20,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:20,198 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:20,256 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 03:12:20,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563173193] [2024-09-13 03:12:20,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563173193] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:20,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801974013] [2024-09-13 03:12:20,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 03:12:20,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:20,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:20,258 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-13 03:12:20,259 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-13 03:12:20,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-13 03:12:20,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:12:20,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-13 03:12:20,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:20,741 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-13 03:12:20,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:23,476 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-13 03:12:23,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801974013] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:23,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:23,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 30 [2024-09-13 03:12:23,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075553220] [2024-09-13 03:12:23,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:23,477 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 03:12:23,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:23,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 03:12:23,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2024-09-13 03:12:23,478 INFO L87 Difference]: Start difference. First operand 91 states and 116 transitions. Second operand has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 24 states have internal predecessors, (74), 12 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (18), 10 states have call predecessors, (18), 12 states have call successors, (18) [2024-09-13 03:12:24,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:24,266 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2024-09-13 03:12:24,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 03:12:24,266 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 24 states have internal predecessors, (74), 12 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (18), 10 states have call predecessors, (18), 12 states have call successors, (18) Word has length 62 [2024-09-13 03:12:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:24,267 INFO L225 Difference]: With dead ends: 127 [2024-09-13 03:12:24,267 INFO L226 Difference]: Without dead ends: 123 [2024-09-13 03:12:24,267 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 115 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-09-13 03:12:24,268 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 64 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:24,268 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 409 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 03:12:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-09-13 03:12:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 101. [2024-09-13 03:12:24,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.088235294117647) internal successors, (74), 66 states have internal predecessors, (74), 12 states have call successors, (12), 6 states have call predecessors, (12), 20 states have return successors, (45), 28 states have call predecessors, (45), 11 states have call successors, (45) [2024-09-13 03:12:24,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 131 transitions. [2024-09-13 03:12:24,299 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 131 transitions. Word has length 62 [2024-09-13 03:12:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:24,300 INFO L474 AbstractCegarLoop]: Abstraction has 101 states and 131 transitions. [2024-09-13 03:12:24,300 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.5517241379310347) internal successors, (74), 24 states have internal predecessors, (74), 12 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (18), 10 states have call predecessors, (18), 12 states have call successors, (18) [2024-09-13 03:12:24,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2024-09-13 03:12:24,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-13 03:12:24,301 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:24,301 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, 1, 1, 1, 1] [2024-09-13 03:12:24,315 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-09-13 03:12:24,505 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-13 03:12:24,506 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:24,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1047042077, now seen corresponding path program 10 times [2024-09-13 03:12:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412191347] [2024-09-13 03:12:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,672 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,807 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,855 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-13 03:12:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,946 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:24,996 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:25,038 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-13 03:12:25,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412191347] [2024-09-13 03:12:25,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412191347] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:25,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669833792] [2024-09-13 03:12:25,039 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 03:12:25,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:25,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:25,040 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-13 03:12:25,042 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-13 03:12:25,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 03:12:25,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:12:25,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-13 03:12:25,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:25,561 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-13 03:12:25,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:28,338 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-13 03:12:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669833792] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:28,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:28,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 28 [2024-09-13 03:12:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376221430] [2024-09-13 03:12:28,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:28,339 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-09-13 03:12:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-09-13 03:12:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2024-09-13 03:12:28,340 INFO L87 Difference]: Start difference. First operand 101 states and 131 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 23 states have internal predecessors, (71), 12 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (18), 9 states have call predecessors, (18), 12 states have call successors, (18) [2024-09-13 03:12:29,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:29,166 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2024-09-13 03:12:29,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 03:12:29,167 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 23 states have internal predecessors, (71), 12 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (18), 9 states have call predecessors, (18), 12 states have call successors, (18) Word has length 62 [2024-09-13 03:12:29,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:29,168 INFO L225 Difference]: With dead ends: 132 [2024-09-13 03:12:29,168 INFO L226 Difference]: Without dead ends: 128 [2024-09-13 03:12:29,168 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 115 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 03:12:29,169 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 25 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:29,169 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 453 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 03:12:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-09-13 03:12:29,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2024-09-13 03:12:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.082191780821918) internal successors, (79), 70 states have internal predecessors, (79), 12 states have call successors, (12), 6 states have call predecessors, (12), 22 states have return successors, (51), 31 states have call predecessors, (51), 11 states have call successors, (51) [2024-09-13 03:12:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 142 transitions. [2024-09-13 03:12:29,207 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 142 transitions. Word has length 62 [2024-09-13 03:12:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:29,208 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 142 transitions. [2024-09-13 03:12:29,208 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 23 states have internal predecessors, (71), 12 states have call successors, (16), 1 states have call predecessors, (16), 9 states have return successors, (18), 9 states have call predecessors, (18), 12 states have call successors, (18) [2024-09-13 03:12:29,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 142 transitions. [2024-09-13 03:12:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 03:12:29,209 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:29,209 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:12:29,221 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-09-13 03:12:29,409 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-13 03:12:29,409 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:29,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:29,410 INFO L85 PathProgramCache]: Analyzing trace with hash 330869257, now seen corresponding path program 11 times [2024-09-13 03:12:29,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872096512] [2024-09-13 03:12:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:29,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:29,492 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:29,494 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:29,591 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:29,668 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:29,754 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:29,891 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:29,925 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-13 03:12:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:30,020 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:30,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-13 03:12:30,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872096512] [2024-09-13 03:12:30,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872096512] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:30,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186991684] [2024-09-13 03:12:30,145 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-13 03:12:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:30,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:30,146 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:12:30,147 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-09-13 03:12:30,286 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-09-13 03:12:30,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:12:30,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-09-13 03:12:30,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-13 03:12:30,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 7 proven. 54 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:12:34,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186991684] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:34,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:34,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 23] total 36 [2024-09-13 03:12:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235002027] [2024-09-13 03:12:34,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:34,497 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-13 03:12:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-13 03:12:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2024-09-13 03:12:34,498 INFO L87 Difference]: Start difference. First operand 108 states and 142 transitions. Second operand has 36 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 28 states have internal predecessors, (81), 14 states have call successors, (19), 1 states have call predecessors, (19), 12 states have return successors, (20), 12 states have call predecessors, (20), 14 states have call successors, (20) [2024-09-13 03:12:35,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:35,613 INFO L93 Difference]: Finished difference Result 162 states and 220 transitions. [2024-09-13 03:12:35,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-13 03:12:35,614 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 28 states have internal predecessors, (81), 14 states have call successors, (19), 1 states have call predecessors, (19), 12 states have return successors, (20), 12 states have call predecessors, (20), 14 states have call successors, (20) Word has length 70 [2024-09-13 03:12:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:35,615 INFO L225 Difference]: With dead ends: 162 [2024-09-13 03:12:35,615 INFO L226 Difference]: Without dead ends: 158 [2024-09-13 03:12:35,615 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 128 SyntacticMatches, 12 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=1679, Unknown=0, NotChecked=0, Total=1892 [2024-09-13 03:12:35,615 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 41 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:35,616 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 561 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-13 03:12:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-09-13 03:12:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 106. [2024-09-13 03:12:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 68 states have internal predecessors, (78), 12 states have call successors, (12), 6 states have call predecessors, (12), 21 states have return successors, (49), 31 states have call predecessors, (49), 11 states have call successors, (49) [2024-09-13 03:12:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2024-09-13 03:12:35,648 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 70 [2024-09-13 03:12:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:35,648 INFO L474 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2024-09-13 03:12:35,648 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.4545454545454546) internal successors, (81), 28 states have internal predecessors, (81), 14 states have call successors, (19), 1 states have call predecessors, (19), 12 states have return successors, (20), 12 states have call predecessors, (20), 14 states have call successors, (20) [2024-09-13 03:12:35,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2024-09-13 03:12:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 03:12:35,649 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:35,649 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 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-13 03:12:35,662 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-09-13 03:12:35,849 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-13 03:12:35,850 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:35,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:35,850 INFO L85 PathProgramCache]: Analyzing trace with hash -786652311, now seen corresponding path program 12 times [2024-09-13 03:12:35,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380839860] [2024-09-13 03:12:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:35,940 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:35,943 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,027 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,094 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,287 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,332 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-13 03:12:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,407 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-09-13 03:12:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380839860] [2024-09-13 03:12:36,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380839860] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:36,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935963144] [2024-09-13 03:12:36,509 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-13 03:12:36,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:36,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:36,510 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:12:36,511 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-09-13 03:12:36,649 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-09-13 03:12:36,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:12:36,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-13 03:12:36,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 20 proven. 32 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-09-13 03:12:37,569 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 55 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-13 03:12:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935963144] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:43,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:43,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 26] total 53 [2024-09-13 03:12:43,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777163080] [2024-09-13 03:12:43,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:43,326 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-09-13 03:12:43,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:43,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-09-13 03:12:43,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2024-09-13 03:12:43,328 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand has 53 states, 47 states have (on average 2.127659574468085) internal successors, (100), 40 states have internal predecessors, (100), 19 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (25), 17 states have call predecessors, (25), 19 states have call successors, (25) [2024-09-13 03:12:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:45,030 INFO L93 Difference]: Finished difference Result 165 states and 221 transitions. [2024-09-13 03:12:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-13 03:12:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 47 states have (on average 2.127659574468085) internal successors, (100), 40 states have internal predecessors, (100), 19 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (25), 17 states have call predecessors, (25), 19 states have call successors, (25) Word has length 70 [2024-09-13 03:12:45,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:45,031 INFO L225 Difference]: With dead ends: 165 [2024-09-13 03:12:45,031 INFO L226 Difference]: Without dead ends: 161 [2024-09-13 03:12:45,032 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 119 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=423, Invalid=3609, Unknown=0, NotChecked=0, Total=4032 [2024-09-13 03:12:45,032 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 46 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:45,033 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 748 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-13 03:12:45,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-09-13 03:12:45,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 109. [2024-09-13 03:12:45,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 70 states have internal predecessors, (80), 12 states have call successors, (12), 6 states have call predecessors, (12), 22 states have return successors, (52), 32 states have call predecessors, (52), 11 states have call successors, (52) [2024-09-13 03:12:45,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 144 transitions. [2024-09-13 03:12:45,068 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 144 transitions. Word has length 70 [2024-09-13 03:12:45,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:45,068 INFO L474 AbstractCegarLoop]: Abstraction has 109 states and 144 transitions. [2024-09-13 03:12:45,068 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 47 states have (on average 2.127659574468085) internal successors, (100), 40 states have internal predecessors, (100), 19 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (25), 17 states have call predecessors, (25), 19 states have call successors, (25) [2024-09-13 03:12:45,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:45,068 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 144 transitions. [2024-09-13 03:12:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 03:12:45,069 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:45,069 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 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-13 03:12:45,083 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-09-13 03:12:45,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-13 03:12:45,270 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:45,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2019705943, now seen corresponding path program 13 times [2024-09-13 03:12:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193377521] [2024-09-13 03:12:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,450 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,625 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,804 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,833 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-13 03:12:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:45,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,953 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 31 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-09-13 03:12:45,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193377521] [2024-09-13 03:12:45,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193377521] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:45,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090947754] [2024-09-13 03:12:45,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-13 03:12:45,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:45,996 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:12:46,001 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-09-13 03:12:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:46,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-13 03:12:46,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-09-13 03:12:46,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 5 proven. 59 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-13 03:12:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090947754] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:51,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 25] total 44 [2024-09-13 03:12:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669861927] [2024-09-13 03:12:51,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:51,454 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-13 03:12:51,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-13 03:12:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1731, Unknown=0, NotChecked=0, Total=1892 [2024-09-13 03:12:51,454 INFO L87 Difference]: Start difference. First operand 109 states and 144 transitions. Second operand has 44 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 34 states have internal predecessors, (90), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2024-09-13 03:12:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:12:53,379 INFO L93 Difference]: Finished difference Result 159 states and 211 transitions. [2024-09-13 03:12:53,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-13 03:12:53,379 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 34 states have internal predecessors, (90), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) Word has length 70 [2024-09-13 03:12:53,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:12:53,380 INFO L225 Difference]: With dead ends: 159 [2024-09-13 03:12:53,380 INFO L226 Difference]: Without dead ends: 155 [2024-09-13 03:12:53,381 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=449, Invalid=3211, Unknown=0, NotChecked=0, Total=3660 [2024-09-13 03:12:53,381 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 65 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:12:53,382 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 775 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-09-13 03:12:53,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-13 03:12:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 98. [2024-09-13 03:12:53,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 64 states have internal predecessors, (72), 12 states have call successors, (12), 6 states have call predecessors, (12), 19 states have return successors, (43), 27 states have call predecessors, (43), 11 states have call successors, (43) [2024-09-13 03:12:53,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2024-09-13 03:12:53,413 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 70 [2024-09-13 03:12:53,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:12:53,414 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2024-09-13 03:12:53,414 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 39 states have (on average 2.3076923076923075) internal successors, (90), 34 states have internal predecessors, (90), 18 states have call successors, (22), 1 states have call predecessors, (22), 12 states have return successors, (25), 14 states have call predecessors, (25), 18 states have call successors, (25) [2024-09-13 03:12:53,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:53,414 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2024-09-13 03:12:53,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-09-13 03:12:53,415 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:12:53,415 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:12:53,431 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-09-13 03:12:53,615 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-13 03:12:53,617 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:12:53,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:12:53,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1157739785, now seen corresponding path program 14 times [2024-09-13 03:12:53,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:12:53,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85631253] [2024-09-13 03:12:53,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:12:53,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:12:53,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:53,694 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:12:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:53,695 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:12:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:53,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:53,819 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:53,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:53,976 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:12:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:54,030 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-09-13 03:12:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:54,136 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:54,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:12:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:12:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 29 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-13 03:12:54,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:12:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85631253] [2024-09-13 03:12:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85631253] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:12:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141473476] [2024-09-13 03:12:54,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:12:54,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:12:54,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:12:54,230 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:12:54,230 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-09-13 03:12:54,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:12:54,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:12:54,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-09-13 03:12:54,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:12:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 17 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-13 03:12:55,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:12:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 5 proven. 61 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-13 03:12:59,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141473476] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:12:59,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:12:59,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 25] total 40 [2024-09-13 03:12:59,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136283217] [2024-09-13 03:12:59,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:12:59,121 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-13 03:12:59,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:12:59,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-13 03:12:59,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1431, Unknown=0, NotChecked=0, Total=1560 [2024-09-13 03:12:59,121 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 40 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 31 states have internal predecessors, (88), 16 states have call successors, (19), 1 states have call predecessors, (19), 12 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22) [2024-09-13 03:13:00,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:13:00,698 INFO L93 Difference]: Finished difference Result 159 states and 213 transitions. [2024-09-13 03:13:00,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-13 03:13:00,698 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 31 states have internal predecessors, (88), 16 states have call successors, (19), 1 states have call predecessors, (19), 12 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22) Word has length 70 [2024-09-13 03:13:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:13:00,699 INFO L225 Difference]: With dead ends: 159 [2024-09-13 03:13:00,699 INFO L226 Difference]: Without dead ends: 155 [2024-09-13 03:13:00,700 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 128 SyntacticMatches, 8 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2024-09-13 03:13:00,704 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-09-13 03:13:00,704 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 676 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-09-13 03:13:00,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-13 03:13:00,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 88. [2024-09-13 03:13:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 58 states have internal predecessors, (65), 12 states have call successors, (12), 6 states have call predecessors, (12), 16 states have return successors, (34), 23 states have call predecessors, (34), 11 states have call successors, (34) [2024-09-13 03:13:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 111 transitions. [2024-09-13 03:13:00,735 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 111 transitions. Word has length 70 [2024-09-13 03:13:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:13:00,735 INFO L474 AbstractCegarLoop]: Abstraction has 88 states and 111 transitions. [2024-09-13 03:13:00,735 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 31 states have internal predecessors, (88), 16 states have call successors, (19), 1 states have call predecessors, (19), 12 states have return successors, (22), 13 states have call predecessors, (22), 16 states have call successors, (22) [2024-09-13 03:13:00,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:13:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 111 transitions. [2024-09-13 03:13:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-09-13 03:13:00,737 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:13:00,737 INFO L216 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 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-13 03:13:00,750 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-09-13 03:13:00,937 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-09-13 03:13:00,938 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:13:00,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:13:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -434407587, now seen corresponding path program 15 times [2024-09-13 03:13:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:13:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147147386] [2024-09-13 03:13:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:13:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:13:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,080 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:13:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,082 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:13:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,174 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,276 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,561 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,793 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:01,939 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-13 03:13:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:02,062 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:02,120 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-09-13 03:13:02,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:13:02,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147147386] [2024-09-13 03:13:02,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147147386] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:13:02,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150142592] [2024-09-13 03:13:02,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-13 03:13:02,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:13:02,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:13:02,176 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:13:02,176 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-09-13 03:13:02,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-09-13 03:13:02,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:13:02,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-09-13 03:13:02,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:13:03,916 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 26 proven. 39 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-09-13 03:13:03,917 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:13:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 9 proven. 83 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:13:13,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150142592] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:13:13,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:13:13,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 28] total 66 [2024-09-13 03:13:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307070525] [2024-09-13 03:13:13,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:13:13,175 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-09-13 03:13:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:13:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-09-13 03:13:13,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=4034, Unknown=0, NotChecked=0, Total=4290 [2024-09-13 03:13:13,176 INFO L87 Difference]: Start difference. First operand 88 states and 111 transitions. Second operand has 66 states, 59 states have (on average 2.0338983050847457) internal successors, (120), 48 states have internal predecessors, (120), 20 states have call successors, (25), 1 states have call predecessors, (25), 22 states have return successors, (28), 24 states have call predecessors, (28), 20 states have call successors, (28) [2024-09-13 03:13:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:13:18,070 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2024-09-13 03:13:18,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-09-13 03:13:18,071 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 59 states have (on average 2.0338983050847457) internal successors, (120), 48 states have internal predecessors, (120), 20 states have call successors, (25), 1 states have call predecessors, (25), 22 states have return successors, (28), 24 states have call predecessors, (28), 20 states have call successors, (28) Word has length 78 [2024-09-13 03:13:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:13:18,072 INFO L225 Difference]: With dead ends: 190 [2024-09-13 03:13:18,072 INFO L226 Difference]: Without dead ends: 186 [2024-09-13 03:13:18,073 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=965, Invalid=8347, Unknown=0, NotChecked=0, Total=9312 [2024-09-13 03:13:18,073 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 102 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:13:18,073 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1155 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-09-13 03:13:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-09-13 03:13:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 66. [2024-09-13 03:13:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 45 states have internal predecessors, (50), 11 states have call successors, (11), 6 states have call predecessors, (11), 10 states have return successors, (17), 14 states have call predecessors, (17), 10 states have call successors, (17) [2024-09-13 03:13:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2024-09-13 03:13:18,110 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 78 [2024-09-13 03:13:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:13:18,110 INFO L474 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2024-09-13 03:13:18,110 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 59 states have (on average 2.0338983050847457) internal successors, (120), 48 states have internal predecessors, (120), 20 states have call successors, (25), 1 states have call predecessors, (25), 22 states have return successors, (28), 24 states have call predecessors, (28), 20 states have call successors, (28) [2024-09-13 03:13:18,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:13:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2024-09-13 03:13:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-13 03:13:18,111 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:13:18,111 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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, 1] [2024-09-13 03:13:18,124 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-09-13 03:13:18,311 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:13:18,311 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:13:18,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:13:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash -878294995, now seen corresponding path program 16 times [2024-09-13 03:13:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:13:18,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672398302] [2024-09-13 03:13:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:13:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:13:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,378 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:13:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,379 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:13:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,543 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:13:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,631 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,675 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,749 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:13:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:13:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672398302] [2024-09-13 03:13:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672398302] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:13:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915300513] [2024-09-13 03:13:18,836 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-13 03:13:18,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:13:18,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:13:18,837 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:13:18,838 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-09-13 03:13:19,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-13 03:13:19,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:13:19,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-13 03:13:19,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:13:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:13:19,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:13:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-13 03:13:21,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915300513] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:13:21,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-13 03:13:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 40 [2024-09-13 03:13:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907316554] [2024-09-13 03:13:21,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-13 03:13:21,961 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-09-13 03:13:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:13:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-09-13 03:13:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1426, Unknown=0, NotChecked=0, Total=1560 [2024-09-13 03:13:21,962 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 40 states, 35 states have (on average 2.342857142857143) internal successors, (82), 33 states have internal predecessors, (82), 16 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (20), 12 states have call predecessors, (20), 16 states have call successors, (20) [2024-09-13 03:13:22,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:13:22,940 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2024-09-13 03:13:22,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-13 03:13:22,940 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 35 states have (on average 2.342857142857143) internal successors, (82), 33 states have internal predecessors, (82), 16 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (20), 12 states have call predecessors, (20), 16 states have call successors, (20) Word has length 61 [2024-09-13 03:13:22,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:13:22,941 INFO L225 Difference]: With dead ends: 89 [2024-09-13 03:13:22,941 INFO L226 Difference]: Without dead ends: 80 [2024-09-13 03:13:22,941 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=263, Invalid=2089, Unknown=0, NotChecked=0, Total=2352 [2024-09-13 03:13:22,942 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 03:13:22,942 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 482 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 03:13:22,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-13 03:13:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-09-13 03:13:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 11 states have call successors, (11), 6 states have call predecessors, (11), 12 states have return successors, (21), 15 states have call predecessors, (21), 10 states have call successors, (21) [2024-09-13 03:13:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2024-09-13 03:13:22,966 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 85 transitions. Word has length 61 [2024-09-13 03:13:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:13:22,966 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 85 transitions. [2024-09-13 03:13:22,966 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 35 states have (on average 2.342857142857143) internal successors, (82), 33 states have internal predecessors, (82), 16 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (20), 12 states have call predecessors, (20), 16 states have call successors, (20) [2024-09-13 03:13:22,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:13:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 85 transitions. [2024-09-13 03:13:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-09-13 03:13:22,966 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:13:22,967 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2024-09-13 03:13:22,979 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-09-13 03:13:23,167 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:13:23,167 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:13:23,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:13:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1161725235, now seen corresponding path program 5 times [2024-09-13 03:13:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:13:23,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114014135] [2024-09-13 03:13:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:13:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:13:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,239 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:13:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,248 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:13:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,301 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,368 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:13:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,399 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-09-13 03:13:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,466 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,510 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,583 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:13:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:13:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:13:23,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:13:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114014135] [2024-09-13 03:13:23,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114014135] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:13:23,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727981148] [2024-09-13 03:13:23,667 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-13 03:13:23,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:13:23,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:13:23,668 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:13:23,669 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-09-13 03:13:23,878 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-09-13 03:13:23,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:13:23,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-09-13 03:13:23,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:13:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-13 03:13:24,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:14:11,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727981148] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:14:11,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:14:11,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 30 [2024-09-13 03:14:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790919462] [2024-09-13 03:14:11,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:14:11,090 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 03:14:11,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-13 03:14:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 03:14:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1347, Unknown=7, NotChecked=0, Total=1482 [2024-09-13 03:14:11,091 INFO L87 Difference]: Start difference. First operand 71 states and 85 transitions. Second operand has 30 states, 26 states have (on average 2.230769230769231) internal successors, (58), 24 states have internal predecessors, (58), 11 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-09-13 03:14:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:14:15,813 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2024-09-13 03:14:15,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-13 03:14:15,813 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 2.230769230769231) internal successors, (58), 24 states have internal predecessors, (58), 11 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 61 [2024-09-13 03:14:15,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:14:15,814 INFO L225 Difference]: With dead ends: 91 [2024-09-13 03:14:15,814 INFO L226 Difference]: Without dead ends: 82 [2024-09-13 03:14:15,814 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 7 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=253, Invalid=1996, Unknown=7, NotChecked=0, Total=2256 [2024-09-13 03:14:15,815 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 27 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-09-13 03:14:15,815 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 499 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-09-13 03:14:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-13 03:14:15,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2024-09-13 03:14:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.125) internal successors, (54), 49 states have internal predecessors, (54), 11 states have call successors, (11), 6 states have call predecessors, (11), 12 states have return successors, (21), 16 states have call predecessors, (21), 10 states have call successors, (21) [2024-09-13 03:14:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2024-09-13 03:14:15,845 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 61 [2024-09-13 03:14:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:14:15,845 INFO L474 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2024-09-13 03:14:15,845 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 2.230769230769231) internal successors, (58), 24 states have internal predecessors, (58), 11 states have call successors, (13), 1 states have call predecessors, (13), 11 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-09-13 03:14:15,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:14:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2024-09-13 03:14:15,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-09-13 03:14:15,846 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:14:15,846 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-09-13 03:14:15,858 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-09-13 03:14:16,046 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-09-13 03:14:16,046 INFO L399 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:14:16,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:14:16,047 INFO L85 PathProgramCache]: Analyzing trace with hash 658720185, now seen corresponding path program 17 times [2024-09-13 03:14:16,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-13 03:14:16,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619339803] [2024-09-13 03:14:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:14:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-13 03:14:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:16,180 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-13 03:14:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:16,181 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-13 03:14:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:16,385 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:14:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:16,766 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:14:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:17,087 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-09-13 03:14:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:17,247 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-09-13 03:14:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:17,539 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:14:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:17,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:14:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:17,882 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-09-13 03:14:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:14:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-13 03:14:18,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-13 03:14:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619339803] [2024-09-13 03:14:18,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619339803] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:14:18,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289587318] [2024-09-13 03:14:18,052 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-13 03:14:18,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:14:18,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:14:18,053 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-13 03:14:18,054 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-09-13 03:14:18,270 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-09-13 03:14:18,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:14:18,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-13 03:14:18,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:14:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-09-13 03:14:20,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:15:39,574 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_gcd_#in~y1| |c_gcd_#in~y2|))) (and (forall ((v_gcd_~y1_BEFORE_CALL_114 Int)) (or (< (* (div |c_gcd_#t~ret5| 3) 4) (+ 2 (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_114 4)) 12))) (< v_gcd_~y1_BEFORE_CALL_114 .cse0))) (forall ((v_gcd_~y1_BEFORE_CALL_114 Int)) (or (< (* |c_gcd_#t~ret5| 16) (let ((.cse1 (* v_gcd_~y1_BEFORE_CALL_114 4))) (+ 2 (* 12 (div (+ (- 1) .cse1) 12)) (mod (+ .cse1 11) 12)))) (< v_gcd_~y1_BEFORE_CALL_114 .cse0))) (forall ((v_gcd_~y1_BEFORE_CALL_114 Int)) (let ((.cse2 (div (+ (- 1) |c_gcd_#t~ret5|) 3)) (.cse3 (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_114 4)) 12))) (or (< (+ .cse2 |c_gcd_#t~ret5|) (+ .cse3 1)) (< (+ (* .cse2 4) 1) .cse3) (< v_gcd_~y1_BEFORE_CALL_114 .cse0)))))) is different from false [2024-09-13 03:16:27,056 WARN L249 Executor]: External (MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-09-13 03:16:27,058 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-09-13 03:16:27,058 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-13 03:16:27,073 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-09-13 03:16:27,259 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-13 03:16:27,260 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:915) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:364) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:410) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-09-13 03:16:27,264 INFO L158 Benchmark]: Toolchain (without parser) took 376087.20ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 107.7MB in the beginning and 83.6MB in the end (delta: 24.1MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2024-09-13 03:16:27,264 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 03:16:27,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.50ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 95.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-13 03:16:27,264 INFO L158 Benchmark]: Boogie Procedure Inliner took 14.71ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 94.7MB in the end (delta: 866.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-13 03:16:27,265 INFO L158 Benchmark]: Boogie Preprocessor took 24.47ms. Allocated memory is still 163.6MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-13 03:16:27,265 INFO L158 Benchmark]: RCFGBuilder took 292.59ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 78.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-09-13 03:16:27,265 INFO L158 Benchmark]: TraceAbstraction took 375550.71ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 77.9MB in the beginning and 83.6MB in the end (delta: -5.6MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-09-13 03:16:27,266 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 123.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.50ms. Allocated memory is still 163.6MB. Free memory was 107.3MB in the beginning and 95.6MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 14.71ms. Allocated memory is still 163.6MB. Free memory was 95.6MB in the beginning and 94.7MB in the end (delta: 866.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.47ms. Allocated memory is still 163.6MB. Free memory was 94.7MB in the beginning and 93.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 292.59ms. Allocated memory is still 163.6MB. Free memory was 93.0MB in the beginning and 78.8MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 375550.71ms. Allocated memory was 163.6MB in the beginning and 216.0MB in the end (delta: 52.4MB). Free memory was 77.9MB in the beginning and 83.6MB in the end (delta: -5.6MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_Bitvector.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 --procedureinliner.inline.calls.to.implemented.procedures NEVER --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-5189fb6-m [2024-09-13 03:16:28,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-13 03:16:28,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-13 03:16:28,979 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-13 03:16:28,980 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-13 03:16:29,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-13 03:16:29,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-13 03:16:29,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-13 03:16:29,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-13 03:16:29,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-13 03:16:29,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-13 03:16:29,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-13 03:16:29,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-13 03:16:29,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-13 03:16:29,010 INFO L153 SettingsManager]: * Use SBE=true [2024-09-13 03:16:29,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-13 03:16:29,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-13 03:16:29,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-13 03:16:29,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-13 03:16:29,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-13 03:16:29,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-13 03:16:29,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-13 03:16:29,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-13 03:16:29,015 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-13 03:16:29,015 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-13 03:16:29,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-13 03:16:29,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-13 03:16:29,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-13 03:16:29,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-13 03:16:29,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-13 03:16:29,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-13 03:16:29,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-13 03:16:29,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-13 03:16:29,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-13 03:16:29,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:16:29,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-13 03:16:29,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-13 03:16:29,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-13 03:16:29,017 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-13 03:16:29,017 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-13 03:16:29,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-13 03:16:29,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-13 03:16:29,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-13 03:16:29,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-13 03:16:29,021 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-13 03:16:29,021 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.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 [2024-09-13 03:16:29,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-13 03:16:29,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-13 03:16:29,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-13 03:16:29,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-13 03:16:29,304 INFO L274 PluginConnector]: CDTParser initialized [2024-09-13 03:16:29,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/gcd02.c [2024-09-13 03:16:30,623 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-13 03:16:30,780 INFO L384 CDTParser]: Found 1 translation units. [2024-09-13 03:16:30,780 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c [2024-09-13 03:16:30,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/b87badf0f/86dabb2ddf1747f19c0f8e7e92107cbf/FLAGbf23fafc3 [2024-09-13 03:16:31,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/b87badf0f/86dabb2ddf1747f19c0f8e7e92107cbf [2024-09-13 03:16:31,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-13 03:16:31,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-13 03:16:31,185 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-13 03:16:31,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-13 03:16:31,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-13 03:16:31,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbb3867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31, skipping insertion in model container [2024-09-13 03:16:31,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,205 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-13 03:16:31,331 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-13 03:16:31,345 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-13 03:16:31,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:16:31,366 INFO L200 MainTranslator]: Completed pre-run [2024-09-13 03:16:31,378 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-13 03:16:31,385 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-13 03:16:31,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-13 03:16:31,403 INFO L204 MainTranslator]: Completed translation [2024-09-13 03:16:31,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31 WrapperNode [2024-09-13 03:16:31,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-13 03:16:31,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-13 03:16:31,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-13 03:16:31,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-13 03:16:31,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,423 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-13 03:16:31,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-13 03:16:31,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-13 03:16:31,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-13 03:16:31,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-13 03:16:31,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,447 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-13 03:16:31,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-13 03:16:31,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-13 03:16:31,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-13 03:16:31,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-13 03:16:31,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (1/1) ... [2024-09-13 03:16:31,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-13 03:16:31,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-13 03:16:31,492 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-13 03:16:31,495 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-13 03:16:31,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-13 03:16:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-09-13 03:16:31,533 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-09-13 03:16:31,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-13 03:16:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-13 03:16:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-13 03:16:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-13 03:16:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-13 03:16:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-13 03:16:31,534 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2024-09-13 03:16:31,534 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2024-09-13 03:16:31,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-13 03:16:31,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-13 03:16:31,599 INFO L242 CfgBuilder]: Building ICFG [2024-09-13 03:16:31,601 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-13 03:16:31,765 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-09-13 03:16:31,765 INFO L291 CfgBuilder]: Performing block encoding [2024-09-13 03:16:31,795 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-13 03:16:31,796 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-13 03:16:31,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:16:31 BoogieIcfgContainer [2024-09-13 03:16:31,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-13 03:16:31,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-13 03:16:31,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-13 03:16:31,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-13 03:16:31,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 03:16:31" (1/3) ... [2024-09-13 03:16:31,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ecb167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:16:31, skipping insertion in model container [2024-09-13 03:16:31,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 03:16:31" (2/3) ... [2024-09-13 03:16:31,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ecb167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 03:16:31, skipping insertion in model container [2024-09-13 03:16:31,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 03:16:31" (3/3) ... [2024-09-13 03:16:31,803 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2024-09-13 03:16:31,818 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-13 03:16:31,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-09-13 03:16:31,869 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-13 03:16:31,874 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;@1746d78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-13 03:16:31,875 INFO L337 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-09-13 03:16:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:16:31,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-13 03:16:31,885 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:31,885 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:16:31,886 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:31,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:31,891 INFO L85 PathProgramCache]: Analyzing trace with hash 378493011, now seen corresponding path program 1 times [2024-09-13 03:16:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:31,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148089455] [2024-09-13 03:16:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:31,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:31,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:31,907 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-09-13 03:16:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:31,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-13 03:16:31,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:32,075 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-13 03:16:32,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:16:32,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:32,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148089455] [2024-09-13 03:16:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148089455] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:16:32,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:16:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-13 03:16:32,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440495012] [2024-09-13 03:16:32,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:16:32,082 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-13 03:16:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:32,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-13 03:16:32,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-13 03:16:32,101 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 25 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:16:32,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:32,227 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2024-09-13 03:16:32,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-13 03:16:32,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-09-13 03:16:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:32,236 INFO L225 Difference]: With dead ends: 83 [2024-09-13 03:16:32,237 INFO L226 Difference]: Without dead ends: 47 [2024-09-13 03:16:32,240 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-13 03:16:32,243 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:32,244 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 179 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:16:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-09-13 03:16:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2024-09-13 03:16:32,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-09-13 03:16:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-09-13 03:16:32,278 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 12 [2024-09-13 03:16:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:32,280 INFO L474 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-09-13 03:16:32,280 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:16:32,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:32,281 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-09-13 03:16:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 03:16:32,282 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:32,282 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:16:32,290 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-09-13 03:16:32,483 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:32,483 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:32,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:32,484 INFO L85 PathProgramCache]: Analyzing trace with hash 2063714771, now seen corresponding path program 1 times [2024-09-13 03:16:32,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:32,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945614336] [2024-09-13 03:16:32,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:32,487 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:32,488 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-09-13 03:16:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:32,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 03:16:32,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:32,806 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-13 03:16:32,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:16:32,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945614336] [2024-09-13 03:16:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945614336] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:16:32,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:16:32,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-13 03:16:32,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821414591] [2024-09-13 03:16:32,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:16:32,808 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 03:16:32,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 03:16:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-13 03:16:32,810 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:16:33,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:33,353 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2024-09-13 03:16:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 03:16:33,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-13 03:16:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:33,355 INFO L225 Difference]: With dead ends: 67 [2024-09-13 03:16:33,356 INFO L226 Difference]: Without dead ends: 65 [2024-09-13 03:16:33,357 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-09-13 03:16:33,358 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 52 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:33,359 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 150 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:16:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-09-13 03:16:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2024-09-13 03:16:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 03:16:33,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-09-13 03:16:33,382 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 17 [2024-09-13 03:16:33,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:33,382 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-09-13 03:16:33,382 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:16:33,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2024-09-13 03:16:33,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-13 03:16:33,385 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:33,386 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:16:33,389 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-09-13 03:16:33,587 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:33,587 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:33,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2060884626, now seen corresponding path program 1 times [2024-09-13 03:16:33,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:33,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970942610] [2024-09-13 03:16:33,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:33,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:33,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:33,590 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:33,591 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-09-13 03:16:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:33,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-13 03:16:33,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:33,827 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-13 03:16:33,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:16:33,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970942610] [2024-09-13 03:16:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970942610] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:16:33,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:16:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-13 03:16:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420162531] [2024-09-13 03:16:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:16:33,828 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 03:16:33,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:33,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 03:16:33,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-13 03:16:33,829 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 10 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:16:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:34,245 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2024-09-13 03:16:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-13 03:16:34,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-09-13 03:16:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:34,247 INFO L225 Difference]: With dead ends: 65 [2024-09-13 03:16:34,247 INFO L226 Difference]: Without dead ends: 63 [2024-09-13 03:16:34,248 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-09-13 03:16:34,248 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:34,249 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 185 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:16:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-13 03:16:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2024-09-13 03:16:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 03:16:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-09-13 03:16:34,270 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 17 [2024-09-13 03:16:34,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:34,270 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-09-13 03:16:34,270 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-13 03:16:34,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2024-09-13 03:16:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-09-13 03:16:34,272 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:34,272 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:16:34,275 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-09-13 03:16:34,472 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:34,473 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:34,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1260738140, now seen corresponding path program 1 times [2024-09-13 03:16:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:34,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345756981] [2024-09-13 03:16:34,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:34,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:34,477 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:34,478 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-09-13 03:16:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:34,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-13 03:16:34,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:34,522 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-13 03:16:34,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:16:34,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:34,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345756981] [2024-09-13 03:16:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345756981] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:16:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:16:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 03:16:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868146903] [2024-09-13 03:16:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:16:34,523 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 03:16:34,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 03:16:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 03:16:34,524 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 03:16:34,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:34,573 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-09-13 03:16:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 03:16:34,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-09-13 03:16:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:34,576 INFO L225 Difference]: With dead ends: 58 [2024-09-13 03:16:34,577 INFO L226 Difference]: Without dead ends: 55 [2024-09-13 03:16:34,578 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-13 03:16:34,578 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:34,579 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:16:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-09-13 03:16:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-09-13 03:16:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-09-13 03:16:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-09-13 03:16:34,602 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 22 [2024-09-13 03:16:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:34,603 INFO L474 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-09-13 03:16:34,603 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-13 03:16:34,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2024-09-13 03:16:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-13 03:16:34,604 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:34,604 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-13 03:16:34,607 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-09-13 03:16:34,804 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:34,805 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:34,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -405244336, now seen corresponding path program 1 times [2024-09-13 03:16:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222999515] [2024-09-13 03:16:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:34,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:34,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:34,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:34,810 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-09-13 03:16:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:34,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-13 03:16:34,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:34,940 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-13 03:16:34,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:16:34,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:34,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222999515] [2024-09-13 03:16:34,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1222999515] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:16:34,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:16:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-13 03:16:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733875370] [2024-09-13 03:16:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:16:34,941 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-13 03:16:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:34,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-13 03:16:34,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-13 03:16:34,942 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 03:16:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:35,111 INFO L93 Difference]: Finished difference Result 69 states and 86 transitions. [2024-09-13 03:16:35,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-13 03:16:35,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2024-09-13 03:16:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:35,113 INFO L225 Difference]: With dead ends: 69 [2024-09-13 03:16:35,113 INFO L226 Difference]: Without dead ends: 66 [2024-09-13 03:16:35,113 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-13 03:16:35,114 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:35,114 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 127 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:16:35,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-09-13 03:16:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2024-09-13 03:16:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-09-13 03:16:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-09-13 03:16:35,129 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 23 [2024-09-13 03:16:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:35,129 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-09-13 03:16:35,129 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-13 03:16:35,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2024-09-13 03:16:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-13 03:16:35,130 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:35,131 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, 1, 1, 1] [2024-09-13 03:16:35,136 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-09-13 03:16:35,331 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:35,331 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:35,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2012943198, now seen corresponding path program 1 times [2024-09-13 03:16:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:35,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634618834] [2024-09-13 03:16:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:35,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:35,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:35,334 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-09-13 03:16:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:35,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-13 03:16:35,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:35,380 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-13 03:16:35,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:16:35,381 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:35,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634618834] [2024-09-13 03:16:35,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634618834] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:16:35,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:16:35,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-13 03:16:35,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955230182] [2024-09-13 03:16:35,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:16:35,382 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-13 03:16:35,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-13 03:16:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-13 03:16:35,383 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 03:16:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:35,410 INFO L93 Difference]: Finished difference Result 65 states and 80 transitions. [2024-09-13 03:16:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-13 03:16:35,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2024-09-13 03:16:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:35,412 INFO L225 Difference]: With dead ends: 65 [2024-09-13 03:16:35,412 INFO L226 Difference]: Without dead ends: 57 [2024-09-13 03:16:35,412 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-13 03:16:35,413 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:35,413 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-13 03:16:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-13 03:16:35,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-13 03:16:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 12 states have call successors, (12), 6 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 11 states have call successors, (14) [2024-09-13 03:16:35,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2024-09-13 03:16:35,430 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 29 [2024-09-13 03:16:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:35,431 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2024-09-13 03:16:35,431 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-09-13 03:16:35,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2024-09-13 03:16:35,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-13 03:16:35,435 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:35,435 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, 1, 1] [2024-09-13 03:16:35,440 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-09-13 03:16:35,636 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:35,636 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:35,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:35,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1256305262, now seen corresponding path program 1 times [2024-09-13 03:16:35,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:35,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446901506] [2024-09-13 03:16:35,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:35,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:35,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:35,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:35,639 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-09-13 03:16:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:35,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 03:16:35,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:35,829 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-13 03:16:35,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:16:36,217 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-13 03:16:36,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:36,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446901506] [2024-09-13 03:16:36,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446901506] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:16:36,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:16:36,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2024-09-13 03:16:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116419170] [2024-09-13 03:16:36,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:16:36,219 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 03:16:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 03:16:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-09-13 03:16:36,219 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 21 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-13 03:16:36,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:36,504 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2024-09-13 03:16:36,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-13 03:16:36,505 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 30 [2024-09-13 03:16:36,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:36,506 INFO L225 Difference]: With dead ends: 66 [2024-09-13 03:16:36,506 INFO L226 Difference]: Without dead ends: 59 [2024-09-13 03:16:36,506 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2024-09-13 03:16:36,507 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:36,507 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 166 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-13 03:16:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-13 03:16:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2024-09-13 03:16:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-09-13 03:16:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2024-09-13 03:16:36,518 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 30 [2024-09-13 03:16:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:36,519 INFO L474 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2024-09-13 03:16:36,519 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.0) internal successors, (34), 19 states have internal predecessors, (34), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-13 03:16:36,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2024-09-13 03:16:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 03:16:36,520 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:36,520 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, 1, 1, 1] [2024-09-13 03:16:36,525 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-09-13 03:16:36,720 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:36,721 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:36,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:36,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1675479748, now seen corresponding path program 1 times [2024-09-13 03:16:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720792414] [2024-09-13 03:16:36,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:36,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:36,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:36,724 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:36,725 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-09-13 03:16:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:36,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-13 03:16:36,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:36,843 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-13 03:16:36,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-13 03:16:36,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:36,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720792414] [2024-09-13 03:16:36,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720792414] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-13 03:16:36,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-13 03:16:36,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-13 03:16:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587481597] [2024-09-13 03:16:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-13 03:16:36,845 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-13 03:16:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:36,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-13 03:16:36,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-09-13 03:16:36,846 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 03:16:36,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:36,998 INFO L93 Difference]: Finished difference Result 74 states and 93 transitions. [2024-09-13 03:16:36,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-13 03:16:36,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2024-09-13 03:16:36,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:37,000 INFO L225 Difference]: With dead ends: 74 [2024-09-13 03:16:37,000 INFO L226 Difference]: Without dead ends: 71 [2024-09-13 03:16:37,000 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-13 03:16:37,001 INFO L434 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:37,001 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 127 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-13 03:16:37,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-09-13 03:16:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 61. [2024-09-13 03:16:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.15) internal successors, (46), 41 states have internal predecessors, (46), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (17), 13 states have call predecessors, (17), 11 states have call successors, (17) [2024-09-13 03:16:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-09-13 03:16:37,032 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2024-09-13 03:16:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:37,032 INFO L474 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-09-13 03:16:37,032 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 4 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-13 03:16:37,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-09-13 03:16:37,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-13 03:16:37,035 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:37,035 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, 1, 1, 1] [2024-09-13 03:16:37,043 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-09-13 03:16:37,236 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:37,236 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:37,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1243328868, now seen corresponding path program 1 times [2024-09-13 03:16:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310639468] [2024-09-13 03:16:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:37,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:37,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:37,240 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:37,241 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-09-13 03:16:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:37,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-09-13 03:16:37,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:37,538 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-13 03:16:37,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:16:38,535 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-13 03:16:38,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:38,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310639468] [2024-09-13 03:16:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310639468] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:16:38,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:16:38,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2024-09-13 03:16:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157961275] [2024-09-13 03:16:38,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:16:38,536 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-13 03:16:38,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:38,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-13 03:16:38,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2024-09-13 03:16:38,537 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 7 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:16:39,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:39,345 INFO L93 Difference]: Finished difference Result 96 states and 123 transitions. [2024-09-13 03:16:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 03:16:39,346 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 7 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 31 [2024-09-13 03:16:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:39,347 INFO L225 Difference]: With dead ends: 96 [2024-09-13 03:16:39,347 INFO L226 Difference]: Without dead ends: 93 [2024-09-13 03:16:39,347 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2024-09-13 03:16:39,348 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:39,348 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 353 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 03:16:39,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-13 03:16:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 65. [2024-09-13 03:16:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (20), 15 states have call predecessors, (20), 11 states have call successors, (20) [2024-09-13 03:16:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2024-09-13 03:16:39,363 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 31 [2024-09-13 03:16:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:39,364 INFO L474 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2024-09-13 03:16:39,364 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.52) internal successors, (38), 23 states have internal predecessors, (38), 7 states have call successors, (8), 1 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:16:39,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:39,365 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2024-09-13 03:16:39,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-13 03:16:39,366 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:39,366 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, 1, 1, 1] [2024-09-13 03:16:39,370 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-09-13 03:16:39,566 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:39,566 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:39,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:39,567 INFO L85 PathProgramCache]: Analyzing trace with hash -983854590, now seen corresponding path program 1 times [2024-09-13 03:16:39,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:39,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852839350] [2024-09-13 03:16:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:39,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:39,569 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:39,569 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-09-13 03:16:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:39,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 03:16:39,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-13 03:16:39,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:16:41,189 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-13 03:16:41,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:41,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852839350] [2024-09-13 03:16:41,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852839350] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:16:41,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:16:41,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 30 [2024-09-13 03:16:41,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900421635] [2024-09-13 03:16:41,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:16:41,190 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-13 03:16:41,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-13 03:16:41,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2024-09-13 03:16:41,191 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 30 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-13 03:16:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:41,964 INFO L93 Difference]: Finished difference Result 92 states and 119 transitions. [2024-09-13 03:16:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-09-13 03:16:41,968 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 38 [2024-09-13 03:16:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:41,969 INFO L225 Difference]: With dead ends: 92 [2024-09-13 03:16:41,969 INFO L226 Difference]: Without dead ends: 79 [2024-09-13 03:16:41,970 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=1367, Unknown=0, NotChecked=0, Total=1560 [2024-09-13 03:16:41,970 INFO L434 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:41,970 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 268 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-13 03:16:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-13 03:16:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 64. [2024-09-13 03:16:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (19), 14 states have call predecessors, (19), 11 states have call successors, (19) [2024-09-13 03:16:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2024-09-13 03:16:41,987 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 38 [2024-09-13 03:16:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:41,987 INFO L474 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2024-09-13 03:16:41,987 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 26 states have internal predecessors, (45), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-13 03:16:41,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2024-09-13 03:16:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-09-13 03:16:41,989 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:41,990 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, 1, 1, 1] [2024-09-13 03:16:41,993 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-09-13 03:16:42,190 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:42,191 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:42,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2133601442, now seen corresponding path program 1 times [2024-09-13 03:16:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:42,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732082621] [2024-09-13 03:16:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:42,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:42,193 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-09-13 03:16:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:42,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-13 03:16:42,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-13 03:16:42,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:16:43,700 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-13 03:16:43,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:43,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732082621] [2024-09-13 03:16:43,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732082621] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-13 03:16:43,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:16:43,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2024-09-13 03:16:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287208251] [2024-09-13 03:16:43,701 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:16:43,701 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-13 03:16:43,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-13 03:16:43,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-09-13 03:16:43,702 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-13 03:16:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:44,695 INFO L93 Difference]: Finished difference Result 102 states and 131 transitions. [2024-09-13 03:16:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-13 03:16:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 38 [2024-09-13 03:16:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:44,697 INFO L225 Difference]: With dead ends: 102 [2024-09-13 03:16:44,697 INFO L226 Difference]: Without dead ends: 99 [2024-09-13 03:16:44,697 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 03:16:44,698 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:44,698 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 261 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-13 03:16:44,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-13 03:16:44,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 77. [2024-09-13 03:16:44,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.12) internal successors, (56), 52 states have internal predecessors, (56), 13 states have call successors, (13), 6 states have call predecessors, (13), 13 states have return successors, (30), 18 states have call predecessors, (30), 12 states have call successors, (30) [2024-09-13 03:16:44,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 99 transitions. [2024-09-13 03:16:44,713 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 99 transitions. Word has length 38 [2024-09-13 03:16:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:44,714 INFO L474 AbstractCegarLoop]: Abstraction has 77 states and 99 transitions. [2024-09-13 03:16:44,714 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 21 states have internal predecessors, (44), 8 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2024-09-13 03:16:44,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 99 transitions. [2024-09-13 03:16:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 03:16:44,715 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:44,715 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, 1, 1, 1] [2024-09-13 03:16:44,718 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-09-13 03:16:44,915 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:44,915 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:44,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1805620880, now seen corresponding path program 1 times [2024-09-13 03:16:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530198758] [2024-09-13 03:16:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:44,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:44,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:44,917 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:44,918 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-09-13 03:16:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:44,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-13 03:16:44,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-13 03:16:45,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:16:46,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-13 03:16:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530198758] [2024-09-13 03:16:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [530198758] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:16:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [203262905] [2024-09-13 03:16:46,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-13 03:16:46,734 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-13 03:16:46,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-13 03:16:46,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-13 03:16:46,736 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-09-13 03:16:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-13 03:16:46,801 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-09-13 03:16:46,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-13 03:16:47,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-13 03:16:48,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [203262905] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-13 03:16:48,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-13 03:16:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2024-09-13 03:16:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429444259] [2024-09-13 03:16:48,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-13 03:16:48,913 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-13 03:16:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-13 03:16:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-13 03:16:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2024-09-13 03:16:48,914 INFO L87 Difference]: Start difference. First operand 77 states and 99 transitions. Second operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:16:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-13 03:16:49,882 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2024-09-13 03:16:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-13 03:16:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 39 [2024-09-13 03:16:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-13 03:16:49,885 INFO L225 Difference]: With dead ends: 108 [2024-09-13 03:16:49,885 INFO L226 Difference]: Without dead ends: 105 [2024-09-13 03:16:49,886 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=191, Invalid=1531, Unknown=0, NotChecked=0, Total=1722 [2024-09-13 03:16:49,887 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-13 03:16:49,887 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 264 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-13 03:16:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-09-13 03:16:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 81. [2024-09-13 03:16:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 13 states have call successors, (13), 6 states have call predecessors, (13), 14 states have return successors, (33), 20 states have call predecessors, (33), 12 states have call successors, (33) [2024-09-13 03:16:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2024-09-13 03:16:49,912 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2024-09-13 03:16:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-13 03:16:49,912 INFO L474 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2024-09-13 03:16:49,913 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-13 03:16:49,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2024-09-13 03:16:49,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-13 03:16:49,915 INFO L208 NwaCegarLoop]: Found error trace [2024-09-13 03:16:49,915 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, 1, 1, 1] [2024-09-13 03:16:49,919 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-09-13 03:16:50,120 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2024-09-13 03:16:50,317 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,14 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-13 03:16:50,318 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [gcdErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-13 03:16:50,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-13 03:16:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1847109936, now seen corresponding path program 2 times [2024-09-13 03:16:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-13 03:16:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910443366] [2024-09-13 03:16:50,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-13 03:16:50,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-09-13 03:16:50,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-13 03:16:50,320 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-09-13 03:16:50,321 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-09-13 03:16:50,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-13 03:16:50,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-13 03:16:50,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-09-13 03:16:50,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-13 03:16:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-13 03:16:50,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... Killed by 15