./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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a9b967e5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/gcd02.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:49:34,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:49:34,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 19:49:34,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:49:34,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:49:34,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:49:34,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:49:34,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:49:34,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:49:34,300 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:49:34,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:49:34,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:49:34,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:49:34,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:49:34,304 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:49:34,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:49:34,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:49:34,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:49:34,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 19:49:34,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:49:34,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:49:34,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:49:34,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:49:34,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:49:34,312 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:49:34,313 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:49:34,313 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:49:34,314 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:49:34,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:49:34,314 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:49:34,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:49:34,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:49:34,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:49:34,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:49:34,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:49:34,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:49:34,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 19:49:34,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 19:49:34,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:49:34,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:49:34,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:49:34,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:49:34,322 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:49:34,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:49:34,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:49:34,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:49:34,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:49:34,676 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:49:34,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/gcd02.c [2024-09-12 19:49:36,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:49:36,331 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:49:36,331 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c [2024-09-12 19:49:36,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/bd1316aa7/914abcd019804bf2bd6f0593313ff892/FLAG98d302094 [2024-09-12 19:49:36,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/bd1316aa7/914abcd019804bf2bd6f0593313ff892 [2024-09-12 19:49:36,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:49:36,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:49:36,359 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:49:36,359 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:49:36,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:49:36,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b442d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36, skipping insertion in model container [2024-09-12 19:49:36,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:49:36,536 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-12 19:49:36,555 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-12 19:49:36,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:49:36,572 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:49:36,588 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-12 19:49:36,592 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-12 19:49:36,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:49:36,626 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:49:36,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36 WrapperNode [2024-09-12 19:49:36,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:49:36,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:49:36,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:49:36,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:49:36,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,652 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:49:36,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:49:36,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:49:36,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:49:36,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:49:36,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,693 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-12 19:49:36,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:49:36,712 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:49:36,712 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:49:36,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:49:36,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (1/1) ... [2024-09-12 19:49:36,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:49:36,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:36,752 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-12 19:49:36,755 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-12 19:49:36,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:49:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-09-12 19:49:36,807 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-09-12 19:49:36,807 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:49:36,809 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 19:49:36,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:49:36,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2024-09-12 19:49:36,810 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2024-09-12 19:49:36,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:49:36,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:49:36,889 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:49:36,892 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:49:37,155 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-12 19:49:37,156 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:49:37,181 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:49:37,182 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:49:37,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:49:37 BoogieIcfgContainer [2024-09-12 19:49:37,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:49:37,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:49:37,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:49:37,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:49:37,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:49:36" (1/3) ... [2024-09-12 19:49:37,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69144e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:49:37, skipping insertion in model container [2024-09-12 19:49:37,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:49:36" (2/3) ... [2024-09-12 19:49:37,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69144e31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:49:37, skipping insertion in model container [2024-09-12 19:49:37,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:49:37" (3/3) ... [2024-09-12 19:49:37,192 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2024-09-12 19:49:37,208 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:49:37,208 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-09-12 19:49:37,271 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:49:37,279 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;@7dfd2e7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:49:37,280 INFO L337 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-09-12 19:49:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 38 states have internal predecessors, (47), 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-12 19:49:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 19:49:37,291 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:37,292 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:37,293 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:37,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1743277802, now seen corresponding path program 1 times [2024-09-12 19:49:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:37,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448012240] [2024-09-12 19:49:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:37,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:37,676 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:37,689 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-12 19:49:37,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:37,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448012240] [2024-09-12 19:49:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448012240] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:49:37,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522999928] [2024-09-12 19:49:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:37,700 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:49:37,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:37,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:49:37,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:49:37,726 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 38 states have internal predecessors, (47), 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-12 19:49:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:37,947 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2024-09-12 19:49:37,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:49:37,950 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-12 19:49:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:37,960 INFO L225 Difference]: With dead ends: 117 [2024-09-12 19:49:37,961 INFO L226 Difference]: Without dead ends: 68 [2024-09-12 19:49:37,966 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:49:37,971 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 46 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:37,972 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 199 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-09-12 19:49:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2024-09-12 19:49:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.435897435897436) internal successors, (56), 46 states have internal predecessors, (56), 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-12 19:49:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2024-09-12 19:49:38,045 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 12 [2024-09-12 19:49:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:38,048 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2024-09-12 19:49:38,048 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-12 19:49:38,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2024-09-12 19:49:38,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 19:49:38,051 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:38,051 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:38,051 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 19:49:38,052 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:38,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,052 INFO L85 PathProgramCache]: Analyzing trace with hash 252880014, now seen corresponding path program 1 times [2024-09-12 19:49:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:38,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046578892] [2024-09-12 19:49:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,126 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,170 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-12 19:49:38,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:38,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046578892] [2024-09-12 19:49:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046578892] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:38,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:38,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:49:38,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357346919] [2024-09-12 19:49:38,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:38,175 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:49:38,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:49:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:49:38,177 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 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-12 19:49:38,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:38,230 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2024-09-12 19:49:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:49:38,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 19:49:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:38,235 INFO L225 Difference]: With dead ends: 64 [2024-09-12 19:49:38,236 INFO L226 Difference]: Without dead ends: 63 [2024-09-12 19:49:38,237 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:49:38,238 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:38,239 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:49:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-09-12 19:49:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2024-09-12 19:49:38,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 45 states have internal predecessors, (54), 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-12 19:49:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-09-12 19:49:38,262 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 14 [2024-09-12 19:49:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:38,263 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-09-12 19:49:38,263 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 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-12 19:49:38,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-09-12 19:49:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-09-12 19:49:38,265 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:38,265 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:38,265 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 19:49:38,265 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:38,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 252880238, now seen corresponding path program 1 times [2024-09-12 19:49:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:38,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762036503] [2024-09-12 19:49:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,322 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,327 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-12 19:49:38,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:38,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762036503] [2024-09-12 19:49:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762036503] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:38,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:49:38,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693770853] [2024-09-12 19:49:38,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:38,332 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:49:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:38,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:49:38,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:49:38,333 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 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-12 19:49:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:38,378 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2024-09-12 19:49:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:49:38,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-09-12 19:49:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:38,382 INFO L225 Difference]: With dead ends: 63 [2024-09-12 19:49:38,382 INFO L226 Difference]: Without dead ends: 62 [2024-09-12 19:49:38,382 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:49:38,383 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:38,384 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:49:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-09-12 19:49:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2024-09-12 19:49:38,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 44 states have internal predecessors, (52), 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-12 19:49:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2024-09-12 19:49:38,410 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 14 [2024-09-12 19:49:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:38,411 INFO L474 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2024-09-12 19:49:38,411 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 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-12 19:49:38,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2024-09-12 19:49:38,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 19:49:38,413 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:38,413 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:38,414 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-12 19:49:38,414 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting gcdErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:38,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash -750654090, now seen corresponding path program 1 times [2024-09-12 19:49:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:38,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885646228] [2024-09-12 19:49:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,490 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,496 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-12 19:49:38,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:38,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885646228] [2024-09-12 19:49:38,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885646228] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:38,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:38,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:49:38,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134506590] [2024-09-12 19:49:38,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:38,498 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:49:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:38,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:49:38,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:49:38,499 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (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-12 19:49:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:38,628 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2024-09-12 19:49:38,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:49:38,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (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 15 [2024-09-12 19:49:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:38,634 INFO L225 Difference]: With dead ends: 62 [2024-09-12 19:49:38,634 INFO L226 Difference]: Without dead ends: 61 [2024-09-12 19:49:38,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:49:38,635 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 40 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:38,639 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-09-12 19:49:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-09-12 19:49:38,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 43 states have internal predecessors, (50), 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-12 19:49:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2024-09-12 19:49:38,666 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 15 [2024-09-12 19:49:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:38,666 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2024-09-12 19:49:38,667 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (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-12 19:49:38,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2024-09-12 19:49:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 19:49:38,668 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:38,668 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:38,668 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 19:49:38,668 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting gcdErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:38,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash -750647139, now seen corresponding path program 1 times [2024-09-12 19:49:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:38,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156480546] [2024-09-12 19:49:38,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:38,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,734 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:38,742 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-12 19:49:38,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:38,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156480546] [2024-09-12 19:49:38,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156480546] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:38,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:38,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:49:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847015755] [2024-09-12 19:49:38,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:38,744 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:49:38,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:38,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:49:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:49:38,745 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (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-12 19:49:38,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:38,872 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2024-09-12 19:49:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 19:49:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (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 15 [2024-09-12 19:49:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:38,873 INFO L225 Difference]: With dead ends: 61 [2024-09-12 19:49:38,873 INFO L226 Difference]: Without dead ends: 60 [2024-09-12 19:49:38,874 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:49:38,875 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 39 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:38,875 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 133 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:38,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-09-12 19:49:38,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2024-09-12 19:49:38,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 42 states have internal predecessors, (48), 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-12 19:49:38,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-09-12 19:49:38,907 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 15 [2024-09-12 19:49:38,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:38,907 INFO L474 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-09-12 19:49:38,907 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (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-12 19:49:38,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,908 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-09-12 19:49:38,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 19:49:38,908 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:38,909 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:38,909 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-12 19:49:38,909 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:38,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:38,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1563843320, now seen corresponding path program 1 times [2024-09-12 19:49:38,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:38,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124218923] [2024-09-12 19:49:38,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:38,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,067 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,071 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-12 19:49:39,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124218923] [2024-09-12 19:49:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124218923] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:39,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:39,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:49:39,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914798345] [2024-09-12 19:49:39,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:39,072 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:49:39,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:39,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:49:39,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:49:39,073 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-12 19:49:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:39,203 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2024-09-12 19:49:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:49:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 19 [2024-09-12 19:49:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:39,207 INFO L225 Difference]: With dead ends: 84 [2024-09-12 19:49:39,207 INFO L226 Difference]: Without dead ends: 82 [2024-09-12 19:49:39,207 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-12 19:49:39,210 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:39,211 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 124 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-12 19:49:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 70. [2024-09-12 19:49:39,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 53 states have internal predecessors, (61), 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-12 19:49:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2024-09-12 19:49:39,243 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 19 [2024-09-12 19:49:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:39,244 INFO L474 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2024-09-12 19:49:39,244 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-12 19:49:39,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2024-09-12 19:49:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 19:49:39,245 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:39,245 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:39,245 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 19:49:39,245 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:39,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:39,246 INFO L85 PathProgramCache]: Analyzing trace with hash -606637219, now seen corresponding path program 1 times [2024-09-12 19:49:39,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:39,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555770689] [2024-09-12 19:49:39,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:39,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,388 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,396 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-12 19:49:39,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:39,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555770689] [2024-09-12 19:49:39,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555770689] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:39,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:39,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 19:49:39,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286138589] [2024-09-12 19:49:39,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:39,398 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-12 19:49:39,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:39,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-12 19:49:39,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-12 19:49:39,400 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-12 19:49:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:39,568 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2024-09-12 19:49:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:49:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 19 [2024-09-12 19:49:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:39,569 INFO L225 Difference]: With dead ends: 82 [2024-09-12 19:49:39,570 INFO L226 Difference]: Without dead ends: 80 [2024-09-12 19:49:39,570 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-12 19:49:39,573 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:39,573 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 128 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:39,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-09-12 19:49:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2024-09-12 19:49:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 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-12 19:49:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2024-09-12 19:49:39,609 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 19 [2024-09-12 19:49:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:39,611 INFO L474 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2024-09-12 19:49:39,611 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-12 19:49:39,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2024-09-12 19:49:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 19:49:39,612 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:39,612 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:39,612 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 19:49:39,613 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:39,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 613827449, now seen corresponding path program 1 times [2024-09-12 19:49:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351435414] [2024-09-12 19:49:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,643 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,648 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,655 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-12 19:49:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351435414] [2024-09-12 19:49:39,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351435414] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:39,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:39,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 19:49:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484150541] [2024-09-12 19:49:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:39,656 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 19:49:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:39,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 19:49:39,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:49:39,657 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:49:39,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:39,687 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2024-09-12 19:49:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 19:49:39,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-09-12 19:49:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:39,689 INFO L225 Difference]: With dead ends: 70 [2024-09-12 19:49:39,690 INFO L226 Difference]: Without dead ends: 69 [2024-09-12 19:49:39,690 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 19:49:39,691 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 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-12 19:49:39,691 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:49:39,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-09-12 19:49:39,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2024-09-12 19:49:39,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 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-12 19:49:39,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2024-09-12 19:49:39,716 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 20 [2024-09-12 19:49:39,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:39,717 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2024-09-12 19:49:39,717 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:49:39,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-09-12 19:49:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 19:49:39,720 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:39,720 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] [2024-09-12 19:49:39,721 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-12 19:49:39,722 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:39,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1848781779, now seen corresponding path program 1 times [2024-09-12 19:49:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697565908] [2024-09-12 19:49:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,826 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,831 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:39,910 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-12 19:49:39,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:39,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697565908] [2024-09-12 19:49:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697565908] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:39,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:39,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-12 19:49:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564720942] [2024-09-12 19:49:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:39,913 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:49:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:39,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:49:39,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:49:39,914 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:49:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:40,105 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2024-09-12 19:49:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:49:40,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-09-12 19:49:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:40,109 INFO L225 Difference]: With dead ends: 91 [2024-09-12 19:49:40,109 INFO L226 Difference]: Without dead ends: 90 [2024-09-12 19:49:40,110 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:49:40,110 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 25 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:40,110 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 144 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-12 19:49:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2024-09-12 19:49:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-12 19:49:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2024-09-12 19:49:40,139 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 21 [2024-09-12 19:49:40,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:40,139 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2024-09-12 19:49:40,139 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-12 19:49:40,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:40,140 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2024-09-12 19:49:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 19:49:40,147 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:40,147 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-12 19:49:40,147 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 19:49:40,147 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:40,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:40,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1456838431, now seen corresponding path program 1 times [2024-09-12 19:49:40,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:40,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616547705] [2024-09-12 19:49:40,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,182 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,185 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 19:49:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,210 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-12 19:49:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616547705] [2024-09-12 19:49:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616547705] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:40,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-12 19:49:40,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429268618] [2024-09-12 19:49:40,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:40,212 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 19:49:40,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:40,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 19:49:40,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 19:49:40,212 INFO L87 Difference]: Start difference. First operand 80 states and 95 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-12 19:49:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:40,237 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2024-09-12 19:49:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 19:49:40,237 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-12 19:49:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:40,238 INFO L225 Difference]: With dead ends: 88 [2024-09-12 19:49:40,238 INFO L226 Difference]: Without dead ends: 82 [2024-09-12 19:49:40,239 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-12 19:49:40,240 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 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-12 19:49:40,240 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:49:40,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-09-12 19:49:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-09-12 19:49:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-12 19:49:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-09-12 19:49:40,263 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 23 [2024-09-12 19:49:40,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:40,264 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-09-12 19:49:40,264 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-12 19:49:40,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-09-12 19:49:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 19:49:40,265 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:40,267 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-12 19:49:40,267 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 19:49:40,268 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:40,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:40,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1624157561, now seen corresponding path program 1 times [2024-09-12 19:49:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:40,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590389107] [2024-09-12 19:49:40,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:40,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,340 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,343 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,383 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 19:49:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,426 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-12 19:49:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:40,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590389107] [2024-09-12 19:49:40,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590389107] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:40,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:40,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 19:49:40,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118398488] [2024-09-12 19:49:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:40,427 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-12 19:49:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:40,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-12 19:49:40,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-09-12 19:49:40,428 INFO L87 Difference]: Start difference. First operand 82 states and 97 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-12 19:49:40,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:40,602 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2024-09-12 19:49:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 19:49:40,603 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-12 19:49:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:40,604 INFO L225 Difference]: With dead ends: 98 [2024-09-12 19:49:40,604 INFO L226 Difference]: Without dead ends: 92 [2024-09-12 19:49:40,604 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-12 19:49:40,605 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 18 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:40,605 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-12 19:49:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2024-09-12 19:49:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.152542372881356) internal successors, (68), 62 states have internal predecessors, (68), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-09-12 19:49:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-09-12 19:49:40,625 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 24 [2024-09-12 19:49:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:40,626 INFO L474 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-09-12 19:49:40,626 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-12 19:49:40,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:40,627 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-09-12 19:49:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 19:49:40,628 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:40,629 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:40,629 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-12 19:49:40,629 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:40,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:40,629 INFO L85 PathProgramCache]: Analyzing trace with hash -2052679830, now seen corresponding path program 1 times [2024-09-12 19:49:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226096032] [2024-09-12 19:49:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,759 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,762 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:49:40,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:40,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226096032] [2024-09-12 19:49:40,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226096032] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576303959] [2024-09-12 19:49:40,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:40,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:40,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:40,817 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-12 19:49:40,818 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-12 19:49:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:40,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:49:40,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:41,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 19:49:41,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:49:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576303959] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:49:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2024-09-12 19:49:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732579138] [2024-09-12 19:49:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:41,147 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 19:49:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 19:49:41,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2024-09-12 19:49:41,148 INFO L87 Difference]: Start difference. First operand 82 states and 96 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:49:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:41,385 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2024-09-12 19:49:41,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:49:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-09-12 19:49:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:41,387 INFO L225 Difference]: With dead ends: 104 [2024-09-12 19:49:41,387 INFO L226 Difference]: Without dead ends: 103 [2024-09-12 19:49:41,388 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:49:41,388 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 38 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:41,388 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 272 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:41,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-09-12 19:49:41,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 91. [2024-09-12 19:49:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 69 states have internal predecessors, (77), 14 states have call successors, (14), 8 states have call predecessors, (14), 9 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2024-09-12 19:49:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2024-09-12 19:49:41,415 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 27 [2024-09-12 19:49:41,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:41,415 INFO L474 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2024-09-12 19:49:41,415 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:49:41,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2024-09-12 19:49:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 19:49:41,419 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:41,419 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-12 19:49:41,437 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-12 19:49:41,623 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 19:49:41,624 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:41,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash -248326027, now seen corresponding path program 1 times [2024-09-12 19:49:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634807763] [2024-09-12 19:49:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:41,721 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:41,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:41,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:41,787 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:49:41,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634807763] [2024-09-12 19:49:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634807763] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790551414] [2024-09-12 19:49:41,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:41,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:41,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:41,842 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-12 19:49:41,843 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-12 19:49:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:41,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 19:49:41,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:49:42,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:49:42,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790551414] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:42,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:49:42,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-09-12 19:49:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955115901] [2024-09-12 19:49:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:42,049 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:49:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:42,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:49:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2024-09-12 19:49:42,050 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:49:42,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:42,232 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2024-09-12 19:49:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:49:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-09-12 19:49:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:42,234 INFO L225 Difference]: With dead ends: 126 [2024-09-12 19:49:42,234 INFO L226 Difference]: Without dead ends: 125 [2024-09-12 19:49:42,234 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:49:42,235 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 31 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:42,235 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 204 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-09-12 19:49:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 110. [2024-09-12 19:49:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 83 states have internal predecessors, (92), 16 states have call successors, (16), 9 states have call predecessors, (16), 13 states have return successors, (22), 17 states have call predecessors, (22), 15 states have call successors, (22) [2024-09-12 19:49:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2024-09-12 19:49:42,255 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 31 [2024-09-12 19:49:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:42,256 INFO L474 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2024-09-12 19:49:42,256 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:49:42,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:42,256 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2024-09-12 19:49:42,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 19:49:42,257 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:42,257 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-12 19:49:42,274 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-09-12 19:49:42,458 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 19:49:42,458 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:42,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1066598731, now seen corresponding path program 1 times [2024-09-12 19:49:42,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:42,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040553511] [2024-09-12 19:49:42,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:42,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,519 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,523 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:42,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,590 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,615 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-12 19:49:42,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040553511] [2024-09-12 19:49:42,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040553511] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:42,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:42,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 19:49:42,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483851969] [2024-09-12 19:49:42,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:42,617 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:49:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:42,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:49:42,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:49:42,618 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:49:42,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:42,832 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2024-09-12 19:49:42,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:49:42,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-09-12 19:49:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:42,835 INFO L225 Difference]: With dead ends: 143 [2024-09-12 19:49:42,835 INFO L226 Difference]: Without dead ends: 140 [2024-09-12 19:49:42,836 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-09-12 19:49:42,836 INFO L434 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:42,836 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 177 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:42,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-09-12 19:49:42,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-09-12 19:49:42,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 91 states have (on average 1.1538461538461537) internal successors, (105), 95 states have internal predecessors, (105), 18 states have call successors, (18), 10 states have call predecessors, (18), 16 states have return successors, (29), 21 states have call predecessors, (29), 17 states have call successors, (29) [2024-09-12 19:49:42,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 152 transitions. [2024-09-12 19:49:42,863 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 152 transitions. Word has length 31 [2024-09-12 19:49:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:42,863 INFO L474 AbstractCegarLoop]: Abstraction has 127 states and 152 transitions. [2024-09-12 19:49:42,864 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:49:42,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2024-09-12 19:49:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 19:49:42,867 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:42,868 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, 1, 1] [2024-09-12 19:49:42,868 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 19:49:42,868 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:42,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:42,868 INFO L85 PathProgramCache]: Analyzing trace with hash 852709961, now seen corresponding path program 1 times [2024-09-12 19:49:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:42,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53493145] [2024-09-12 19:49:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,907 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,913 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 19:49:42,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,936 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:42,944 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-12 19:49:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53493145] [2024-09-12 19:49:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53493145] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:49:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447254601] [2024-09-12 19:49:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:42,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:49:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:42,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:49:42,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:49:42,947 INFO L87 Difference]: Start difference. First operand 127 states and 152 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-12 19:49:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:42,990 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2024-09-12 19:49:42,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:49:42,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 32 [2024-09-12 19:49:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:42,992 INFO L225 Difference]: With dead ends: 146 [2024-09-12 19:49:42,992 INFO L226 Difference]: Without dead ends: 123 [2024-09-12 19:49:42,993 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-12 19:49:42,993 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 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-12 19:49:42,994 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:49:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-09-12 19:49:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-09-12 19:49:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 89 states have (on average 1.1235955056179776) internal successors, (100), 91 states have internal predecessors, (100), 18 states have call successors, (18), 10 states have call predecessors, (18), 14 states have return successors, (26), 21 states have call predecessors, (26), 17 states have call successors, (26) [2024-09-12 19:49:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2024-09-12 19:49:43,016 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 32 [2024-09-12 19:49:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:43,017 INFO L474 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2024-09-12 19:49:43,017 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-12 19:49:43,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2024-09-12 19:49:43,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 19:49:43,018 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:43,018 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, 1] [2024-09-12 19:49:43,018 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 19:49:43,018 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:43,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:43,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1224334735, now seen corresponding path program 1 times [2024-09-12 19:49:43,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:43,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985060213] [2024-09-12 19:49:43,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:43,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,063 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,066 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,079 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-09-12 19:49:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,123 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,203 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-12 19:49:43,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985060213] [2024-09-12 19:49:43,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985060213] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:43,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015522696] [2024-09-12 19:49:43,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:43,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:43,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:43,206 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-12 19:49:43,207 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-12 19:49:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 19:49:43,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:43,321 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-12 19:49:43,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:43,473 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-12 19:49:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015522696] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:43,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 14 [2024-09-12 19:49:43,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271519534] [2024-09-12 19:49:43,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:43,474 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-09-12 19:49:43,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:43,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-09-12 19:49:43,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:49:43,475 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-12 19:49:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:43,697 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2024-09-12 19:49:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:49:43,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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 33 [2024-09-12 19:49:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:43,698 INFO L225 Difference]: With dead ends: 139 [2024-09-12 19:49:43,698 INFO L226 Difference]: Without dead ends: 111 [2024-09-12 19:49:43,699 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 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-12 19:49:43,699 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:43,700 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 190 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-09-12 19:49:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2024-09-12 19:49:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 15 states have call successors, (15), 8 states have call predecessors, (15), 11 states have return successors, (22), 18 states have call predecessors, (22), 14 states have call successors, (22) [2024-09-12 19:49:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2024-09-12 19:49:43,723 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 33 [2024-09-12 19:49:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:43,723 INFO L474 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2024-09-12 19:49:43,723 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-12 19:49:43,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2024-09-12 19:49:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 19:49:43,725 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:43,725 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, 1, 1] [2024-09-12 19:49:43,749 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-12 19:49:43,929 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-09-12 19:49:43,930 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:43,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:43,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1968518491, now seen corresponding path program 1 times [2024-09-12 19:49:43,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:43,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535061546] [2024-09-12 19:49:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:43,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,978 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:43,981 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:44,034 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:44,050 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:49:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:44,084 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-12 19:49:44,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:44,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535061546] [2024-09-12 19:49:44,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535061546] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:44,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998694412] [2024-09-12 19:49:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:44,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:44,087 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-12 19:49:44,089 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-12 19:49:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:44,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 19:49:44,136 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:44,255 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-12 19:49:44,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:44,601 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-12 19:49:44,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998694412] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:44,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:44,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-09-12 19:49:44,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194603941] [2024-09-12 19:49:44,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:44,603 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 19:49:44,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:44,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 19:49:44,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-09-12 19:49:44,604 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 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-12 19:49:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:44,859 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2024-09-12 19:49:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:49:44,860 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 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 34 [2024-09-12 19:49:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:44,861 INFO L225 Difference]: With dead ends: 122 [2024-09-12 19:49:44,861 INFO L226 Difference]: Without dead ends: 118 [2024-09-12 19:49:44,861 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-09-12 19:49:44,862 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 32 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:44,862 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 239 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-09-12 19:49:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2024-09-12 19:49:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.1216216216216217) internal successors, (83), 76 states have internal predecessors, (83), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (23), 18 states have call predecessors, (23), 14 states have call successors, (23) [2024-09-12 19:49:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 121 transitions. [2024-09-12 19:49:44,886 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 121 transitions. Word has length 34 [2024-09-12 19:49:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:44,887 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 121 transitions. [2024-09-12 19:49:44,887 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.473684210526316) internal successors, (47), 17 states have internal predecessors, (47), 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-12 19:49:44,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 121 transitions. [2024-09-12 19:49:44,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-09-12 19:49:44,888 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:44,888 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, 1, 1] [2024-09-12 19:49:44,905 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-09-12 19:49:45,092 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:45,092 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:45,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:45,093 INFO L85 PathProgramCache]: Analyzing trace with hash -896271259, now seen corresponding path program 1 times [2024-09-12 19:49:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67143696] [2024-09-12 19:49:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,137 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,140 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,179 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,195 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:49:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,237 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-12 19:49:45,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:45,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67143696] [2024-09-12 19:49:45,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67143696] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:45,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:49:45,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 19:49:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438294643] [2024-09-12 19:49:45,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:45,240 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:49:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:49:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:49:45,241 INFO L87 Difference]: Start difference. First operand 103 states and 121 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-12 19:49:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:45,455 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2024-09-12 19:49:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:49:45,456 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 34 [2024-09-12 19:49:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:45,457 INFO L225 Difference]: With dead ends: 122 [2024-09-12 19:49:45,457 INFO L226 Difference]: Without dead ends: 116 [2024-09-12 19:49:45,458 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-09-12 19:49:45,458 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:45,458 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 158 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:45,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-12 19:49:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2024-09-12 19:49:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.1081081081081081) internal successors, (82), 76 states have internal predecessors, (82), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (23), 18 states have call predecessors, (23), 14 states have call successors, (23) [2024-09-12 19:49:45,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2024-09-12 19:49:45,482 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 34 [2024-09-12 19:49:45,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:45,483 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2024-09-12 19:49:45,483 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-12 19:49:45,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:45,483 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2024-09-12 19:49:45,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 19:49:45,484 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:45,484 INFO L216 NwaCegarLoop]: trace histogram [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-12 19:49:45,484 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-12 19:49:45,484 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:45,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:45,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1413232844, now seen corresponding path program 1 times [2024-09-12 19:49:45,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:45,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573911849] [2024-09-12 19:49:45,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:45,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,587 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,656 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,674 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-12 19:49:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573911849] [2024-09-12 19:49:45,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573911849] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791697801] [2024-09-12 19:49:45,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:45,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:45,677 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-12 19:49:45,679 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-12 19:49:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:45,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 19:49:45,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:49:45,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:49:45,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791697801] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:45,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:49:45,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2024-09-12 19:49:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349080816] [2024-09-12 19:49:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:45,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 19:49:45,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 19:49:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:49:45,947 INFO L87 Difference]: Start difference. First operand 103 states and 120 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:49:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:46,197 INFO L93 Difference]: Finished difference Result 126 states and 150 transitions. [2024-09-12 19:49:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 19:49:46,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2024-09-12 19:49:46,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:46,199 INFO L225 Difference]: With dead ends: 126 [2024-09-12 19:49:46,199 INFO L226 Difference]: Without dead ends: 125 [2024-09-12 19:49:46,200 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2024-09-12 19:49:46,200 INFO L434 NwaCegarLoop]: 44 mSDtfsCounter, 40 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:46,200 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 333 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-09-12 19:49:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 112. [2024-09-12 19:49:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.1111111111111112) internal successors, (90), 83 states have internal predecessors, (90), 16 states have call successors, (16), 9 states have call predecessors, (16), 13 states have return successors, (24), 19 states have call predecessors, (24), 15 states have call successors, (24) [2024-09-12 19:49:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2024-09-12 19:49:46,223 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 37 [2024-09-12 19:49:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:46,223 INFO L474 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2024-09-12 19:49:46,223 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:49:46,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2024-09-12 19:49:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 19:49:46,224 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:46,224 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, 1] [2024-09-12 19:49:46,241 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-09-12 19:49:46,425 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:46,425 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:46,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash -981301037, now seen corresponding path program 1 times [2024-09-12 19:49:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940657524] [2024-09-12 19:49:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:46,524 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:46,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:46,608 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:46,686 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:49:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940657524] [2024-09-12 19:49:46,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940657524] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:46,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387649704] [2024-09-12 19:49:46,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:46,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:46,740 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-12 19:49:46,741 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-12 19:49:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:46,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:49:46,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:46,961 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-12 19:49:46,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:49:46,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387649704] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:49:46,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:49:46,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-09-12 19:49:46,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800429626] [2024-09-12 19:49:46,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:49:46,962 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-12 19:49:46,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:46,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-12 19:49:46,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:49:46,963 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:49:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:47,136 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2024-09-12 19:49:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:49:47,136 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-09-12 19:49:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:47,138 INFO L225 Difference]: With dead ends: 120 [2024-09-12 19:49:47,138 INFO L226 Difference]: Without dead ends: 119 [2024-09-12 19:49:47,139 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=590, Unknown=0, NotChecked=0, Total=650 [2024-09-12 19:49:47,139 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:47,139 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 173 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 19:49:47,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-09-12 19:49:47,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2024-09-12 19:49:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 81 states have (on average 1.0987654320987654) internal successors, (89), 82 states have internal predecessors, (89), 16 states have call successors, (16), 9 states have call predecessors, (16), 13 states have return successors, (24), 19 states have call predecessors, (24), 15 states have call successors, (24) [2024-09-12 19:49:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2024-09-12 19:49:47,165 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 41 [2024-09-12 19:49:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:47,165 INFO L474 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2024-09-12 19:49:47,165 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-09-12 19:49:47,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2024-09-12 19:49:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 19:49:47,167 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:47,167 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, 1, 1, 1, 1] [2024-09-12 19:49:47,184 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-09-12 19:49:47,367 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:47,368 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:47,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:47,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1320227821, now seen corresponding path program 1 times [2024-09-12 19:49:47,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:47,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744346886] [2024-09-12 19:49:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:47,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:47,430 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:47,433 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:47,479 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:47,512 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:49:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:47,562 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:47,588 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-12 19:49:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744346886] [2024-09-12 19:49:47,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744346886] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105632466] [2024-09-12 19:49:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:47,591 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-12 19:49:47,592 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-12 19:49:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:47,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 19:49:47,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:47,764 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-12 19:49:47,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:48,377 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-12 19:49:48,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105632466] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:48,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:48,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 13] total 21 [2024-09-12 19:49:48,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324157382] [2024-09-12 19:49:48,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:48,378 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 19:49:48,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:48,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 19:49:48,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2024-09-12 19:49:48,380 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand has 21 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 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-12 19:49:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:48,709 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2024-09-12 19:49:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:49:48,710 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 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 43 [2024-09-12 19:49:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:48,711 INFO L225 Difference]: With dead ends: 150 [2024-09-12 19:49:48,711 INFO L226 Difference]: Without dead ends: 146 [2024-09-12 19:49:48,712 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2024-09-12 19:49:48,712 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:48,713 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 296 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-09-12 19:49:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 121. [2024-09-12 19:49:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.0919540229885059) internal successors, (95), 89 states have internal predecessors, (95), 17 states have call successors, (17), 9 states have call predecessors, (17), 16 states have return successors, (31), 22 states have call predecessors, (31), 16 states have call successors, (31) [2024-09-12 19:49:48,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2024-09-12 19:49:48,751 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 43 [2024-09-12 19:49:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:48,751 INFO L474 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2024-09-12 19:49:48,751 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.2) internal successors, (64), 19 states have internal predecessors, (64), 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-12 19:49:48,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:48,751 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2024-09-12 19:49:48,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 19:49:48,753 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:48,753 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, 1, 1, 1, 1] [2024-09-12 19:49:48,770 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-09-12 19:49:48,953 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:48,954 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:48,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1925074349, now seen corresponding path program 1 times [2024-09-12 19:49:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615037749] [2024-09-12 19:49:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:49,012 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:49,015 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:49,045 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:49,053 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:49:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:49,090 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:49,145 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-12 19:49:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615037749] [2024-09-12 19:49:49,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615037749] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:49,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610984972] [2024-09-12 19:49:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:49,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:49,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:49,148 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-12 19:49:49,149 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-12 19:49:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:49,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-12 19:49:49,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:49,270 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-12 19:49:49,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:49,441 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-12 19:49:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610984972] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:49,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 15 [2024-09-12 19:49:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904512131] [2024-09-12 19:49:49,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:49,443 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-09-12 19:49:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-09-12 19:49:49,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-09-12 19:49:49,445 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 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-12 19:49:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:49,717 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2024-09-12 19:49:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:49:49,718 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 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 43 [2024-09-12 19:49:49,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:49,720 INFO L225 Difference]: With dead ends: 134 [2024-09-12 19:49:49,721 INFO L226 Difference]: Without dead ends: 105 [2024-09-12 19:49:49,721 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 93 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-12 19:49:49,722 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:49,722 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 226 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-09-12 19:49:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2024-09-12 19:49:49,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.1) internal successors, (77), 72 states have internal predecessors, (77), 14 states have call successors, (14), 7 states have call predecessors, (14), 13 states have return successors, (26), 18 states have call predecessors, (26), 13 states have call successors, (26) [2024-09-12 19:49:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2024-09-12 19:49:49,748 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 43 [2024-09-12 19:49:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:49,750 INFO L474 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2024-09-12 19:49:49,750 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 13 states have internal predecessors, (39), 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-12 19:49:49,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:49,750 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2024-09-12 19:49:49,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 19:49:49,751 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:49,751 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, 1, 1, 1, 1] [2024-09-12 19:49:49,769 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-09-12 19:49:49,955 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:49,956 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:49,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:49,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1881658759, now seen corresponding path program 1 times [2024-09-12 19:49:49,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:49,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609589332] [2024-09-12 19:49:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:50,025 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:50,028 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:50,096 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:50,191 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:50,210 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:49:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:49:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609589332] [2024-09-12 19:49:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609589332] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136564800] [2024-09-12 19:49:50,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:50,251 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-12 19:49:50,253 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-12 19:49:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:50,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 19:49:50,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:49:50,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:49:51,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136564800] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:51,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:51,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 36 [2024-09-12 19:49:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259408204] [2024-09-12 19:49:51,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:51,285 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-09-12 19:49:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:51,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-09-12 19:49:51,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2024-09-12 19:49:51,286 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 36 states, 33 states have (on average 2.0) internal successors, (66), 28 states have internal predecessors, (66), 9 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-12 19:49:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:52,097 INFO L93 Difference]: Finished difference Result 131 states and 161 transitions. [2024-09-12 19:49:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 19:49:52,097 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.0) internal successors, (66), 28 states have internal predecessors, (66), 9 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) Word has length 44 [2024-09-12 19:49:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:52,099 INFO L225 Difference]: With dead ends: 131 [2024-09-12 19:49:52,099 INFO L226 Difference]: Without dead ends: 127 [2024-09-12 19:49:52,101 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 68 SyntacticMatches, 8 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2024-09-12 19:49:52,101 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:52,102 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 597 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 19:49:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-09-12 19:49:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2024-09-12 19:49:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 73 states have (on average 1.095890410958904) internal successors, (80), 77 states have internal predecessors, (80), 15 states have call successors, (15), 7 states have call predecessors, (15), 15 states have return successors, (30), 19 states have call predecessors, (30), 14 states have call successors, (30) [2024-09-12 19:49:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2024-09-12 19:49:52,131 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 44 [2024-09-12 19:49:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:52,132 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2024-09-12 19:49:52,132 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.0) internal successors, (66), 28 states have internal predecessors, (66), 9 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-09-12 19:49:52,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2024-09-12 19:49:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 19:49:52,133 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:52,133 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, 1, 1, 1, 1] [2024-09-12 19:49:52,150 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-09-12 19:49:52,337 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-09-12 19:49:52,338 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:52,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -93596857, now seen corresponding path program 2 times [2024-09-12 19:49:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774032829] [2024-09-12 19:49:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:52,404 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:52,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:52,472 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:52,511 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:52,528 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:49:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:52,566 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-12 19:49:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:52,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774032829] [2024-09-12 19:49:52,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774032829] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:52,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943565268] [2024-09-12 19:49:52,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:49:52,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:52,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:52,569 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-12 19:49:52,571 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-12 19:49:52,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:49:52,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:49:52,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-09-12 19:49:52,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 19:49:52,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 19:49:53,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943565268] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:53,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 23 [2024-09-12 19:49:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617317263] [2024-09-12 19:49:53,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:53,329 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-09-12 19:49:53,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-09-12 19:49:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-09-12 19:49:53,330 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 23 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 18 states have internal predecessors, (57), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-12 19:49:53,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:53,756 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2024-09-12 19:49:53,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-09-12 19:49:53,757 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 18 states have internal predecessors, (57), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) Word has length 44 [2024-09-12 19:49:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:53,758 INFO L225 Difference]: With dead ends: 117 [2024-09-12 19:49:53,758 INFO L226 Difference]: Without dead ends: 113 [2024-09-12 19:49:53,759 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 80 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 19:49:53,759 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:53,760 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 233 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:49:53,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-09-12 19:49:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2024-09-12 19:49:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 74 states have internal predecessors, (78), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (27), 18 states have call predecessors, (27), 13 states have call successors, (27) [2024-09-12 19:49:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-09-12 19:49:53,784 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 44 [2024-09-12 19:49:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:53,785 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-09-12 19:49:53,785 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 18 states have internal predecessors, (57), 8 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 7 states have call predecessors, (10), 8 states have call successors, (10) [2024-09-12 19:49:53,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:53,785 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2024-09-12 19:49:53,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-09-12 19:49:53,786 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:53,786 INFO L216 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:53,802 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-09-12 19:49:53,990 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-12 19:49:53,991 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:53,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash -872074217, now seen corresponding path program 2 times [2024-09-12 19:49:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:53,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44083329] [2024-09-12 19:49:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:54,075 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:54,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:54,131 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:54,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-09-12 19:49:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:54,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:54,289 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 19:49:54,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:54,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44083329] [2024-09-12 19:49:54,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44083329] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:54,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531790393] [2024-09-12 19:49:54,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:49:54,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:54,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:54,341 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-12 19:49:54,343 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-12 19:49:54,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:49:54,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:49:54,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-09-12 19:49:54,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 19:49:54,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:49:54,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531790393] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:54,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 24 [2024-09-12 19:49:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952886067] [2024-09-12 19:49:54,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:54,962 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 19:49:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 19:49:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2024-09-12 19:49:54,963 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 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-12 19:49:55,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:55,340 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2024-09-12 19:49:55,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 19:49:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 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 52 [2024-09-12 19:49:55,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:55,342 INFO L225 Difference]: With dead ends: 115 [2024-09-12 19:49:55,342 INFO L226 Difference]: Without dead ends: 106 [2024-09-12 19:49:55,342 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2024-09-12 19:49:55,343 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:55,343 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 334 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:49:55,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-09-12 19:49:55,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 73. [2024-09-12 19:49:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 55 states have internal predecessors, (59), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (15), 11 states have call predecessors, (15), 10 states have call successors, (15) [2024-09-12 19:49:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2024-09-12 19:49:55,362 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 52 [2024-09-12 19:49:55,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:55,362 INFO L474 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2024-09-12 19:49:55,362 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 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-12 19:49:55,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:55,363 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2024-09-12 19:49:55,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 19:49:55,363 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:55,363 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:55,380 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-09-12 19:49:55,564 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-12 19:49:55,564 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:55,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1899598415, now seen corresponding path program 3 times [2024-09-12 19:49:55,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:55,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938835277] [2024-09-12 19:49:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:55,659 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:55,662 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:55,720 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:55,802 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:55,835 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:49:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:55,887 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:49:55,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938835277] [2024-09-12 19:49:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938835277] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267897274] [2024-09-12 19:49:55,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:49:55,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:55,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:55,916 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-12 19:49:55,917 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-12 19:49:55,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 19:49:55,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:49:55,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-12 19:49:55,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-09-12 19:49:56,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:49:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:49:58,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267897274] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:49:58,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:49:58,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 17] total 39 [2024-09-12 19:49:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786362512] [2024-09-12 19:49:58,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:49:58,320 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-09-12 19:49:58,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:49:58,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-09-12 19:49:58,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1358, Unknown=0, NotChecked=0, Total=1482 [2024-09-12 19:49:58,321 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 39 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 30 states have internal predecessors, (97), 15 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2024-09-12 19:49:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:49:58,847 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2024-09-12 19:49:58,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 19:49:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 30 states have internal predecessors, (97), 15 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) Word has length 53 [2024-09-12 19:49:58,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:49:58,849 INFO L225 Difference]: With dead ends: 103 [2024-09-12 19:49:58,849 INFO L226 Difference]: Without dead ends: 99 [2024-09-12 19:49:58,850 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 19:49:58,850 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:49:58,851 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 485 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:49:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-09-12 19:49:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2024-09-12 19:49:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.1) internal successors, (66), 62 states have internal predecessors, (66), 12 states have call successors, (12), 6 states have call predecessors, (12), 11 states have return successors, (22), 15 states have call predecessors, (22), 11 states have call successors, (22) [2024-09-12 19:49:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 100 transitions. [2024-09-12 19:49:58,890 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 100 transitions. Word has length 53 [2024-09-12 19:49:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:49:58,890 INFO L474 AbstractCegarLoop]: Abstraction has 84 states and 100 transitions. [2024-09-12 19:49:58,890 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.6944444444444446) internal successors, (97), 30 states have internal predecessors, (97), 15 states have call successors, (17), 1 states have call predecessors, (17), 12 states have return successors, (16), 12 states have call predecessors, (16), 15 states have call successors, (16) [2024-09-12 19:49:58,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 100 transitions. [2024-09-12 19:49:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 19:49:58,891 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:49:58,892 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, 1, 1, 1, 1, 1, 1] [2024-09-12 19:49:58,905 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-12 19:49:59,095 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-12 19:49:59,096 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:49:59,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:49:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 800259953, now seen corresponding path program 1 times [2024-09-12 19:49:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:49:59,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215657547] [2024-09-12 19:49:59,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:59,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:49:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,230 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:49:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:49:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,280 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,363 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:49:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,381 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:49:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:49:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,461 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-12 19:49:59,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:49:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215657547] [2024-09-12 19:49:59,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215657547] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:49:59,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917913267] [2024-09-12 19:49:59,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:49:59,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:49:59,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:49:59,464 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-12 19:49:59,465 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-12 19:49:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:49:59,536 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-12 19:49:59,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:49:59,836 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-12 19:49:59,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 19:50:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917913267] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:50:00,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:50:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 18] total 35 [2024-09-12 19:50:00,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572348923] [2024-09-12 19:50:00,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:50:00,581 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-09-12 19:50:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:50:00,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-09-12 19:50:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 19:50:00,583 INFO L87 Difference]: Start difference. First operand 84 states and 100 transitions. Second operand has 35 states, 33 states have (on average 2.515151515151515) internal successors, (83), 28 states have internal predecessors, (83), 12 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-12 19:50:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:01,134 INFO L93 Difference]: Finished difference Result 120 states and 151 transitions. [2024-09-12 19:50:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 19:50:01,134 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.515151515151515) internal successors, (83), 28 states have internal predecessors, (83), 12 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 12 states have call successors, (14) Word has length 53 [2024-09-12 19:50:01,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:01,135 INFO L225 Difference]: With dead ends: 120 [2024-09-12 19:50:01,135 INFO L226 Difference]: Without dead ends: 116 [2024-09-12 19:50:01,136 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 88 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=1657, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 19:50:01,137 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:01,137 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 484 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:50:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-12 19:50:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 87. [2024-09-12 19:50:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 62 states have (on average 1.096774193548387) internal successors, (68), 64 states have internal predecessors, (68), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (25), 16 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-12 19:50:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2024-09-12 19:50:01,162 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 53 [2024-09-12 19:50:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:01,163 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2024-09-12 19:50:01,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.515151515151515) internal successors, (83), 28 states have internal predecessors, (83), 12 states have call successors, (14), 1 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 12 states have call successors, (14) [2024-09-12 19:50:01,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2024-09-12 19:50:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 19:50:01,164 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:01,164 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, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:01,179 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-09-12 19:50:01,364 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-12 19:50:01,365 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:01,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1286633905, now seen corresponding path program 2 times [2024-09-12 19:50:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:50:01,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038444061] [2024-09-12 19:50:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:01,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:50:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:01,455 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:50:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:01,458 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:50:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:01,505 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:01,545 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:01,569 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:50:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:01,609 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:01,633 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-12 19:50:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:50:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038444061] [2024-09-12 19:50:01,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038444061] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:50:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173992835] [2024-09-12 19:50:01,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 19:50:01,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:01,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:01,636 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-12 19:50:01,637 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-12 19:50:01,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 19:50:01,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:50:01,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-09-12 19:50:01,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:01,833 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-12 19:50:01,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:02,546 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-12 19:50:02,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173992835] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:50:02,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:50:02,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 22 [2024-09-12 19:50:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700219037] [2024-09-12 19:50:02,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:50:02,547 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 19:50:02,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:50:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 19:50:02,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:50:02,548 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 19 states have internal predecessors, (75), 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-12 19:50:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:02,790 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2024-09-12 19:50:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-09-12 19:50:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 19 states have internal predecessors, (75), 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 53 [2024-09-12 19:50:02,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:02,792 INFO L225 Difference]: With dead ends: 112 [2024-09-12 19:50:02,792 INFO L226 Difference]: Without dead ends: 108 [2024-09-12 19:50:02,792 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 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-12 19:50:02,793 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:02,793 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 252 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:50:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-09-12 19:50:02,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 92. [2024-09-12 19:50:02,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 66 states have internal predecessors, (72), 12 states have call successors, (12), 6 states have call predecessors, (12), 13 states have return successors, (28), 19 states have call predecessors, (28), 11 states have call successors, (28) [2024-09-12 19:50:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2024-09-12 19:50:02,824 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 53 [2024-09-12 19:50:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:02,825 INFO L474 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2024-09-12 19:50:02,825 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 19 states have internal predecessors, (75), 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-12 19:50:02,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2024-09-12 19:50:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 19:50:02,826 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:02,826 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:02,844 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-09-12 19:50:03,030 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-09-12 19:50:03,031 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:03,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1706992621, now seen corresponding path program 3 times [2024-09-12 19:50:03,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:50:03,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198838608] [2024-09-12 19:50:03,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:03,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:50:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,157 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:50:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,160 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:50:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,238 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,315 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,454 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,477 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:50:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,526 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:03,553 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 17 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 19:50:03,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:50:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198838608] [2024-09-12 19:50:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198838608] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:50:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914755665] [2024-09-12 19:50:03,554 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 19:50:03,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:03,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:03,556 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-12 19:50:03,558 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-12 19:50:03,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-12 19:50:03,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:50:03,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-12 19:50:03,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-12 19:50:03,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 19:50:05,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914755665] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:50:05,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:50:05,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 18] total 44 [2024-09-12 19:50:05,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450443470] [2024-09-12 19:50:05,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:50:05,242 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-09-12 19:50:05,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:50:05,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-09-12 19:50:05,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1729, Unknown=0, NotChecked=0, Total=1892 [2024-09-12 19:50:05,243 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 44 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 34 states have internal predecessors, (104), 14 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2024-09-12 19:50:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:06,111 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2024-09-12 19:50:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-12 19:50:06,112 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 34 states have internal predecessors, (104), 14 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) Word has length 63 [2024-09-12 19:50:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:06,114 INFO L225 Difference]: With dead ends: 164 [2024-09-12 19:50:06,114 INFO L226 Difference]: Without dead ends: 160 [2024-09-12 19:50:06,115 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 107 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=395, Invalid=2911, Unknown=0, NotChecked=0, Total=3306 [2024-09-12 19:50:06,115 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 53 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:06,116 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 753 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-09-12 19:50:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-09-12 19:50:06,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 97. [2024-09-12 19:50:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 68 states have internal predecessors, (76), 12 states have call successors, (12), 6 states have call predecessors, (12), 14 states have return successors, (31), 22 states have call predecessors, (31), 11 states have call successors, (31) [2024-09-12 19:50:06,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2024-09-12 19:50:06,168 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 63 [2024-09-12 19:50:06,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:06,169 INFO L474 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2024-09-12 19:50:06,170 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.5365853658536586) internal successors, (104), 34 states have internal predecessors, (104), 14 states have call successors, (18), 1 states have call predecessors, (18), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2024-09-12 19:50:06,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2024-09-12 19:50:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 19:50:06,171 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:06,171 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:06,190 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-09-12 19:50:06,375 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-09-12 19:50:06,376 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:06,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:06,376 INFO L85 PathProgramCache]: Analyzing trace with hash -683579501, now seen corresponding path program 4 times [2024-09-12 19:50:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:50:06,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108622140] [2024-09-12 19:50:06,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:06,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:50:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,465 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:50:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,468 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:50:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,532 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,584 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,645 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,677 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:50:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,725 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-09-12 19:50:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:50:06,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108622140] [2024-09-12 19:50:06,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108622140] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:50:06,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288737493] [2024-09-12 19:50:06,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 19:50:06,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:06,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:06,768 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-12 19:50:06,770 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-12 19:50:06,868 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 19:50:06,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:50:06,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-12 19:50:06,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 19:50:07,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-09-12 19:50:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288737493] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:50:08,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:50:08,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 19] total 34 [2024-09-12 19:50:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712266085] [2024-09-12 19:50:08,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:50:08,313 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-09-12 19:50:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:50:08,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-09-12 19:50:08,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2024-09-12 19:50:08,314 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand has 34 states, 32 states have (on average 3.125) internal successors, (100), 27 states have internal predecessors, (100), 14 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) [2024-09-12 19:50:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:08,834 INFO L93 Difference]: Finished difference Result 139 states and 171 transitions. [2024-09-12 19:50:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-12 19:50:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.125) internal successors, (100), 27 states have internal predecessors, (100), 14 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) Word has length 63 [2024-09-12 19:50:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:08,836 INFO L225 Difference]: With dead ends: 139 [2024-09-12 19:50:08,836 INFO L226 Difference]: Without dead ends: 135 [2024-09-12 19:50:08,837 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 114 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=220, Invalid=1420, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 19:50:08,838 INFO L434 NwaCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:08,838 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 416 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:50:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-09-12 19:50:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 89. [2024-09-12 19:50:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (25), 18 states have call predecessors, (25), 11 states have call successors, (25) [2024-09-12 19:50:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2024-09-12 19:50:08,870 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 63 [2024-09-12 19:50:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:08,871 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2024-09-12 19:50:08,871 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.125) internal successors, (100), 27 states have internal predecessors, (100), 14 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 14 states have call successors, (17) [2024-09-12 19:50:08,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2024-09-12 19:50:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-09-12 19:50:08,872 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:08,872 INFO L216 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:08,891 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-09-12 19:50:09,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:09,077 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:09,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1055490605, now seen corresponding path program 5 times [2024-09-12 19:50:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:50:09,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318915304] [2024-09-12 19:50:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:50:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,166 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:50:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,168 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:50:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,236 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,288 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,373 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-09-12 19:50:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,419 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-09-12 19:50:09,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:50:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318915304] [2024-09-12 19:50:09,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318915304] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:50:09,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25087092] [2024-09-12 19:50:09,447 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-09-12 19:50:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:09,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:09,449 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-12 19:50:09,451 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-12 19:50:09,547 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-09-12 19:50:09,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:50:09,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-09-12 19:50:09,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-09-12 19:50:09,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:11,059 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:50:11,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25087092] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:50:11,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:50:11,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 20] total 37 [2024-09-12 19:50:11,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434409450] [2024-09-12 19:50:11,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:50:11,060 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-09-12 19:50:11,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:50:11,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-09-12 19:50:11,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1214, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 19:50:11,061 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 37 states, 35 states have (on average 2.8857142857142857) internal successors, (101), 29 states have internal predecessors, (101), 15 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-09-12 19:50:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:11,675 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2024-09-12 19:50:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-09-12 19:50:11,676 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.8857142857142857) internal successors, (101), 29 states have internal predecessors, (101), 15 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) Word has length 63 [2024-09-12 19:50:11,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:11,677 INFO L225 Difference]: With dead ends: 170 [2024-09-12 19:50:11,677 INFO L226 Difference]: Without dead ends: 166 [2024-09-12 19:50:11,678 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 109 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2024-09-12 19:50:11,679 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 52 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:11,679 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 534 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:50:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-09-12 19:50:11,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 96. [2024-09-12 19:50:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 68 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 14 states have return successors, (31), 21 states have call predecessors, (31), 11 states have call successors, (31) [2024-09-12 19:50:11,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2024-09-12 19:50:11,726 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 63 [2024-09-12 19:50:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:11,726 INFO L474 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2024-09-12 19:50:11,727 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.8857142857142857) internal successors, (101), 29 states have internal predecessors, (101), 15 states have call successors, (17), 1 states have call predecessors, (17), 10 states have return successors, (17), 11 states have call predecessors, (17), 15 states have call successors, (17) [2024-09-12 19:50:11,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2024-09-12 19:50:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-09-12 19:50:11,728 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:11,728 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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-12 19:50:11,747 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-09-12 19:50:11,928 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:11,929 INFO L399 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:11,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:11,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1607200697, now seen corresponding path program 6 times [2024-09-12 19:50:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:50:11,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124796136] [2024-09-12 19:50:11,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:50:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,076 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:50:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,078 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:50:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,165 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,232 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,303 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,408 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,431 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-09-12 19:50:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,491 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,527 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 19 proven. 31 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-09-12 19:50:12,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:50:12,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124796136] [2024-09-12 19:50:12,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124796136] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:50:12,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385797878] [2024-09-12 19:50:12,554 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-09-12 19:50:12,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:12,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:12,556 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-12 19:50:12,558 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-12 19:50:12,670 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-09-12 19:50:12,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:50:12,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-09-12 19:50:12,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-09-12 19:50:13,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 5 proven. 65 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-09-12 19:50:16,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385797878] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:50:16,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:50:16,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 26] total 54 [2024-09-12 19:50:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013339182] [2024-09-12 19:50:16,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:50:16,123 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-09-12 19:50:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:50:16,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-09-12 19:50:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2648, Unknown=0, NotChecked=0, Total=2862 [2024-09-12 19:50:16,128 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand has 54 states, 51 states have (on average 2.588235294117647) internal successors, (132), 41 states have internal predecessors, (132), 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-12 19:50:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:17,214 INFO L93 Difference]: Finished difference Result 138 states and 177 transitions. [2024-09-12 19:50:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-09-12 19:50:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 51 states have (on average 2.588235294117647) internal successors, (132), 41 states have internal predecessors, (132), 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 82 [2024-09-12 19:50:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:17,216 INFO L225 Difference]: With dead ends: 138 [2024-09-12 19:50:17,216 INFO L226 Difference]: Without dead ends: 134 [2024-09-12 19:50:17,218 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1060 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=554, Invalid=4416, Unknown=0, NotChecked=0, Total=4970 [2024-09-12 19:50:17,218 INFO L434 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:17,219 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 852 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 19:50:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-09-12 19:50:17,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2024-09-12 19:50:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 70 states have internal predecessors, (78), 12 states have call successors, (12), 6 states have call predecessors, (12), 15 states have return successors, (32), 23 states have call predecessors, (32), 11 states have call successors, (32) [2024-09-12 19:50:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2024-09-12 19:50:17,264 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 82 [2024-09-12 19:50:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:17,264 INFO L474 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2024-09-12 19:50:17,264 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 51 states have (on average 2.588235294117647) internal successors, (132), 41 states have internal predecessors, (132), 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-12 19:50:17,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:17,265 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2024-09-12 19:50:17,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-12 19:50:17,266 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:17,266 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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-12 19:50:17,282 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-09-12 19:50:17,467 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-09-12 19:50:17,467 INFO L399 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:17,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:17,467 INFO L85 PathProgramCache]: Analyzing trace with hash -339565511, now seen corresponding path program 4 times [2024-09-12 19:50:17,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:50:17,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653066321] [2024-09-12 19:50:17,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:17,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:50:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,558 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:50:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,560 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:50:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,619 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,683 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,712 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:50:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,763 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,796 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 19:50:17,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:50:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653066321] [2024-09-12 19:50:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653066321] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:50:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581944592] [2024-09-12 19:50:17,821 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-09-12 19:50:17,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:17,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:17,823 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-12 19:50:17,825 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-12 19:50:17,962 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-09-12 19:50:17,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 19:50:17,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-12 19:50:17,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 19:50:18,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 19:50:19,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581944592] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:50:19,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:50:19,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 18] total 27 [2024-09-12 19:50:19,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223630946] [2024-09-12 19:50:19,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:50:19,134 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-09-12 19:50:19,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 19:50:19,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-09-12 19:50:19,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2024-09-12 19:50:19,135 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 23 states have internal predecessors, (88), 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-12 19:50:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:19,522 INFO L93 Difference]: Finished difference Result 127 states and 158 transitions. [2024-09-12 19:50:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 19:50:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 23 states have internal predecessors, (88), 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 62 [2024-09-12 19:50:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:19,524 INFO L225 Difference]: With dead ends: 127 [2024-09-12 19:50:19,524 INFO L226 Difference]: Without dead ends: 123 [2024-09-12 19:50:19,524 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 115 SyntacticMatches, 9 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 19:50:19,525 INFO L434 NwaCegarLoop]: 29 mSDtfsCounter, 19 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:19,525 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 441 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:50:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-09-12 19:50:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 103. [2024-09-12 19:50:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 72 states have internal predecessors, (80), 12 states have call successors, (12), 6 states have call predecessors, (12), 16 states have return successors, (35), 24 states have call predecessors, (35), 11 states have call successors, (35) [2024-09-12 19:50:19,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2024-09-12 19:50:19,567 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 62 [2024-09-12 19:50:19,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:19,567 INFO L474 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2024-09-12 19:50:19,567 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.3846153846153846) internal successors, (88), 23 states have internal predecessors, (88), 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-12 19:50:19,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:19,567 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2024-09-12 19:50:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-09-12 19:50:19,568 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:19,568 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:19,585 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-12 19:50:19,768 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-09-12 19:50:19,769 INFO L399 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:19,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1685981817, now seen corresponding path program 7 times [2024-09-12 19:50:19,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 19:50:19,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936147251] [2024-09-12 19:50:19,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:19,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 19:50:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:19,862 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 19:50:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:19,864 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-09-12 19:50:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:19,910 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:19,972 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-09-12 19:50:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:20,004 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-09-12 19:50:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:20,056 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:20,085 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-12 19:50:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 19:50:20,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 19:50:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936147251] [2024-09-12 19:50:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936147251] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:50:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697251145] [2024-09-12 19:50:20,111 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-09-12 19:50:20,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 19:50:20,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:20,113 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-12 19:50:20,116 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-12 19:50:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:20,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-09-12 19:50:20,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-09-12 19:50:20,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:50:26,692 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_gcd_#in~y1| |c_gcd_#in~y2|))) (and (forall ((v_gcd_~y1_BEFORE_CALL_46 Int)) (or (< v_gcd_~y1_BEFORE_CALL_46 .cse0) (< (* 9 |c_gcd_#res|) (let ((.cse1 (* v_gcd_~y1_BEFORE_CALL_46 3))) (+ 2 (mod (+ 5 .cse1) 6) (* 6 (div (+ (- 1) .cse1) 6))))))) (forall ((v_gcd_~y1_BEFORE_CALL_46 Int)) (or (< v_gcd_~y1_BEFORE_CALL_46 .cse0) (< (+ |c_gcd_#res| (div (+ |c_gcd_#res| 1) 2)) (+ 2 (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_46 3)) 6))))))) is different from false [2024-09-12 19:50:30,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_gcd_#in~y1| |c_gcd_#in~y2|))) (and (forall ((v_gcd_~y1_BEFORE_CALL_46 Int)) (or (< v_gcd_~y1_BEFORE_CALL_46 .cse0) (< (* |c_gcd_#t~ret5| 9) (let ((.cse1 (* v_gcd_~y1_BEFORE_CALL_46 3))) (+ 2 (mod (+ 5 .cse1) 6) (* 6 (div (+ (- 1) .cse1) 6))))))) (forall ((v_gcd_~y1_BEFORE_CALL_46 Int)) (or (< v_gcd_~y1_BEFORE_CALL_46 .cse0) (< (* 3 (div (+ (- 1) |c_gcd_#t~ret5|) 2)) (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_46 3)) 6)))) (forall ((v_gcd_~y1_BEFORE_CALL_46 Int)) (or (< v_gcd_~y1_BEFORE_CALL_46 .cse0) (< (* (div |c_gcd_#t~ret5| 2) 3) (+ 2 (div (+ (- 1) (* v_gcd_~y1_BEFORE_CALL_46 3)) 6))))))) is different from false [2024-09-12 19:50:51,754 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-12 19:50:51,755 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-12 19:50:51,755 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-09-12 19:50:51,768 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-09-12 19:50:51,956 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-09-12 19:50:51,957 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-12 19:50:51,961 INFO L158 Benchmark]: Toolchain (without parser) took 75602.92ms. Allocated memory was 65.0MB in the beginning and 299.9MB in the end (delta: 234.9MB). Free memory was 32.1MB in the beginning and 233.3MB in the end (delta: -201.1MB). Peak memory consumption was 34.5MB. Max. memory is 16.1GB. [2024-09-12 19:50:51,961 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 50.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:50:51,961 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.45ms. Allocated memory is still 65.0MB. Free memory was 32.0MB in the beginning and 35.7MB in the end (delta: -3.7MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-09-12 19:50:51,961 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.11ms. Allocated memory is still 65.0MB. Free memory was 35.7MB in the beginning and 34.8MB in the end (delta: 865.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-09-12 19:50:51,963 INFO L158 Benchmark]: Boogie Preprocessor took 57.24ms. Allocated memory is still 65.0MB. Free memory was 34.8MB in the beginning and 33.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-09-12 19:50:51,963 INFO L158 Benchmark]: RCFGBuilder took 471.34ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 39.9MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-09-12 19:50:51,963 INFO L158 Benchmark]: TraceAbstraction took 74774.56ms. Allocated memory was 65.0MB in the beginning and 299.9MB in the end (delta: 234.9MB). Free memory was 39.0MB in the beginning and 233.3MB in the end (delta: -194.2MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2024-09-12 19:50:51,964 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.21ms. Allocated memory is still 50.3MB. Free memory is still 33.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.45ms. Allocated memory is still 65.0MB. Free memory was 32.0MB in the beginning and 35.7MB in the end (delta: -3.7MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.11ms. Allocated memory is still 65.0MB. Free memory was 35.7MB in the beginning and 34.8MB in the end (delta: 865.8kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.24ms. Allocated memory is still 65.0MB. Free memory was 34.8MB in the beginning and 33.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 471.34ms. Allocated memory is still 65.0MB. Free memory was 32.9MB in the beginning and 39.9MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 74774.56ms. Allocated memory was 65.0MB in the beginning and 299.9MB in the end (delta: 234.9MB). Free memory was 39.0MB in the beginning and 233.3MB in the end (delta: -194.2MB). Peak memory consumption was 40.6MB. 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 --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a9b967e-m [2024-09-12 19:50:53,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 19:50:53,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-09-12 19:50:53,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 19:50:53,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 19:50:54,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 19:50:54,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 19:50:54,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 19:50:54,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 19:50:54,033 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 19:50:54,034 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 19:50:54,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 19:50:54,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 19:50:54,037 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 19:50:54,037 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 19:50:54,038 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 19:50:54,038 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 19:50:54,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 19:50:54,039 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 19:50:54,039 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 19:50:54,039 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 19:50:54,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 19:50:54,040 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 19:50:54,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-09-12 19:50:54,041 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-09-12 19:50:54,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 19:50:54,042 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-09-12 19:50:54,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 19:50:54,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 19:50:54,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 19:50:54,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 19:50:54,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 19:50:54,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 19:50:54,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 19:50:54,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:50:54,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 19:50:54,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 19:50:54,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 19:50:54,045 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-09-12 19:50:54,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-09-12 19:50:54,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 19:50:54,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 19:50:54,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 19:50:54,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 19:50:54,048 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-09-12 19:50:54,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/certificate-witnesses-artifact/automizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/certificate-witnesses-artifact/automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5840bf8cb045a250261e3957017079dce43a53700f7c91e31c16b36d5b980e00 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2024-09-12 19:50:54,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 19:50:54,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 19:50:54,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 19:50:54,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 19:50:54,407 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 19:50:54,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/recursive/gcd02.c [2024-09-12 19:50:55,943 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 19:50:56,115 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 19:50:56,116 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/recursive/gcd02.c [2024-09-12 19:50:56,122 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4a6769f3a/666e8f55189c49379078cb9650d29b3e/FLAGe9a19a942 [2024-09-12 19:50:56,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4a6769f3a/666e8f55189c49379078cb9650d29b3e [2024-09-12 19:50:56,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 19:50:56,137 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 19:50:56,138 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 19:50:56,138 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 19:50:56,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 19:50:56,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5fab73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56, skipping insertion in model container [2024-09-12 19:50:56,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 19:50:56,322 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-12 19:50:56,342 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-12 19:50:56,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:50:56,365 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 19:50:56,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-12 19:50:56,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-12 19:50:56,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 19:50:56,408 INFO L204 MainTranslator]: Completed translation [2024-09-12 19:50:56,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56 WrapperNode [2024-09-12 19:50:56,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 19:50:56,409 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 19:50:56,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 19:50:56,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 19:50:56,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,424 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,429 INFO L138 Inliner]: procedures = 14, calls = 20, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 19:50:56,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 19:50:56,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 19:50:56,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 19:50:56,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 19:50:56,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,460 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-12 19:50:56,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 19:50:56,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 19:50:56,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 19:50:56,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 19:50:56,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (1/1) ... [2024-09-12 19:50:56,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 19:50:56,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 19:50:56,515 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-12 19:50:56,519 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-12 19:50:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 19:50:56,565 INFO L130 BoogieDeclarations]: Found specification of procedure gcd [2024-09-12 19:50:56,566 INFO L138 BoogieDeclarations]: Found implementation of procedure gcd [2024-09-12 19:50:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-09-12 19:50:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-09-12 19:50:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 19:50:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 19:50:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 19:50:56,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 19:50:56,567 INFO L130 BoogieDeclarations]: Found specification of procedure divides [2024-09-12 19:50:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure divides [2024-09-12 19:50:56,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 19:50:56,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 19:50:56,647 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 19:50:56,650 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 19:50:56,895 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-09-12 19:50:56,895 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 19:50:56,930 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 19:50:56,932 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-12 19:50:56,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:50:56 BoogieIcfgContainer [2024-09-12 19:50:56,932 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 19:50:56,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 19:50:56,950 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 19:50:56,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 19:50:56,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 07:50:56" (1/3) ... [2024-09-12 19:50:56,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec6fa0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:50:56, skipping insertion in model container [2024-09-12 19:50:56,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 07:50:56" (2/3) ... [2024-09-12 19:50:56,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec6fa0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 07:50:56, skipping insertion in model container [2024-09-12 19:50:56,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 07:50:56" (3/3) ... [2024-09-12 19:50:56,957 INFO L112 eAbstractionObserver]: Analyzing ICFG gcd02.c [2024-09-12 19:50:56,973 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 19:50:56,974 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-09-12 19:50:57,040 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 19:50:57,048 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;@3a874ff2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 19:50:57,048 INFO L337 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-09-12 19:50:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 37 states have internal predecessors, (46), 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-12 19:50:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 19:50:57,060 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:57,061 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:57,062 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:57,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:57,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1120117323, now seen corresponding path program 1 times [2024-09-12 19:50:57,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:50:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080406550] [2024-09-12 19:50:57,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:57,081 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-12 19:50:57,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:50:57,085 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-12 19:50:57,087 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-12 19:50:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:57,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 19:50:57,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:57,264 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-12 19:50:57,265 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:50:57,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:50:57,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080406550] [2024-09-12 19:50:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080406550] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:50:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:50:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-12 19:50:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405859888] [2024-09-12 19:50:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:50:57,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 19:50:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:50:57,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 19:50:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-12 19:50:57,302 INFO L87 Difference]: Start difference. First operand has 49 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 37 states have internal predecessors, (46), 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-12 19:50:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:57,521 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2024-09-12 19:50:57,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 19:50:57,525 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-12 19:50:57,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:57,534 INFO L225 Difference]: With dead ends: 107 [2024-09-12 19:50:57,534 INFO L226 Difference]: Without dead ends: 59 [2024-09-12 19:50:57,538 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-12 19:50:57,542 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 45 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:57,544 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 163 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:50:57,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-09-12 19:50:57,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-09-12 19:50:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.236842105263158) internal successors, (47), 41 states have internal predecessors, (47), 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-12 19:50:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-09-12 19:50:57,596 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 12 [2024-09-12 19:50:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:57,598 INFO L474 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-09-12 19:50:57,598 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-12 19:50:57,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:57,600 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-09-12 19:50:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 19:50:57,602 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:57,602 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:57,606 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-12 19:50:57,803 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-12 19:50:57,804 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:57,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash 64566296, now seen corresponding path program 1 times [2024-09-12 19:50:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:50:57,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027123435] [2024-09-12 19:50:57,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:57,805 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-12 19:50:57,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:50:57,809 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-12 19:50:57,811 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-12 19:50:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:57,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:50:57,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:58,105 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-12 19:50:58,105 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:50:58,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:50:58,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027123435] [2024-09-12 19:50:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027123435] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:50:58,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:50:58,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-12 19:50:58,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669822244] [2024-09-12 19:50:58,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:50:58,107 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:50:58,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:50:58,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:50:58,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:50:58,112 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 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-12 19:50:58,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:50:58,723 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2024-09-12 19:50:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 19:50:58,725 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 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 19 [2024-09-12 19:50:58,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:50:58,727 INFO L225 Difference]: With dead ends: 83 [2024-09-12 19:50:58,727 INFO L226 Difference]: Without dead ends: 81 [2024-09-12 19:50:58,727 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-09-12 19:50:58,729 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:50:58,729 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 179 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:50:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-09-12 19:50:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2024-09-12 19:50:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 52 states have internal predecessors, (60), 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-12 19:50:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2024-09-12 19:50:58,766 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 19 [2024-09-12 19:50:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:50:58,767 INFO L474 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2024-09-12 19:50:58,767 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 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-12 19:50:58,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2024-09-12 19:50:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 19:50:58,769 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:50:58,769 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:50:58,775 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 (3)] Forceful destruction successful, exit code 0 [2024-09-12 19:50:58,969 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-12 19:50:58,970 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting gcdErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:50:58,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:50:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2105914243, now seen corresponding path program 1 times [2024-09-12 19:50:58,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:50:58,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644294403] [2024-09-12 19:50:58,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:50:58,971 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-12 19:50:58,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:50:58,974 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-12 19:50:58,975 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-12 19:50:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:50:59,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:50:59,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:50:59,311 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-12 19:50:59,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:50:59,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:50:59,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644294403] [2024-09-12 19:50:59,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644294403] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:50:59,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:50:59,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-09-12 19:50:59,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373210553] [2024-09-12 19:50:59,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:50:59,314 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:50:59,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:50:59,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:50:59,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:50:59,315 INFO L87 Difference]: Start difference. First operand 69 states and 81 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 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-12 19:51:00,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:00,059 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2024-09-12 19:51:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 19:51:00,061 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 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 19 [2024-09-12 19:51:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:00,063 INFO L225 Difference]: With dead ends: 81 [2024-09-12 19:51:00,065 INFO L226 Difference]: Without dead ends: 79 [2024-09-12 19:51:00,066 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-09-12 19:51:00,067 INFO L434 NwaCegarLoop]: 45 mSDtfsCounter, 68 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:00,068 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 237 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-09-12 19:51:00,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-09-12 19:51:00,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2024-09-12 19:51:00,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 50 states have internal predecessors, (58), 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-12 19:51:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2024-09-12 19:51:00,095 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 19 [2024-09-12 19:51:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:00,095 INFO L474 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2024-09-12 19:51:00,095 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 8 states have internal predecessors, (14), 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-12 19:51:00,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2024-09-12 19:51:00,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 19:51:00,098 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:00,098 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 19:51:00,102 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-12 19:51:00,300 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-12 19:51:00,301 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:00,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash 493376280, now seen corresponding path program 1 times [2024-09-12 19:51:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:00,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379624492] [2024-09-12 19:51:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:00,302 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-12 19:51:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:00,303 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-12 19:51:00,304 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-12 19:51:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:00,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 19:51:00,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:00,465 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-12 19:51:00,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:51:00,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:00,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379624492] [2024-09-12 19:51:00,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379624492] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:51:00,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:51:00,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-12 19:51:00,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719878911] [2024-09-12 19:51:00,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:51:00,467 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:51:00,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:00,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:51:00,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-12 19:51:00,469 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:51:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:00,711 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2024-09-12 19:51:00,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-12 19:51:00,712 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-09-12 19:51:00,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:00,714 INFO L225 Difference]: With dead ends: 94 [2024-09-12 19:51:00,714 INFO L226 Difference]: Without dead ends: 87 [2024-09-12 19:51:00,714 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:51:00,715 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 28 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:00,715 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 129 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:51:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-09-12 19:51:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2024-09-12 19:51:00,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 60 states have internal predecessors, (67), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 12 states have call successors, (13) [2024-09-12 19:51:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2024-09-12 19:51:00,738 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 20 [2024-09-12 19:51:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:00,739 INFO L474 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2024-09-12 19:51:00,739 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:51:00,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2024-09-12 19:51:00,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-09-12 19:51:00,740 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:00,741 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] [2024-09-12 19:51:00,744 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 (5)] Ended with exit code 0 [2024-09-12 19:51:00,941 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-12 19:51:00,941 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:00,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:00,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1533414880, now seen corresponding path program 1 times [2024-09-12 19:51:00,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:00,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670589951] [2024-09-12 19:51:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:00,942 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-12 19:51:00,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:00,945 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-12 19:51:00,946 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-12 19:51:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:00,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-12 19:51:00,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 19:51:01,095 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:51:01,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670589951] [2024-09-12 19:51:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670589951] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:51:01,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:51:01,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-12 19:51:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661059011] [2024-09-12 19:51:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:51:01,096 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 19:51:01,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:01,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 19:51:01,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-09-12 19:51:01,097 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 10 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:51:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:01,441 INFO L93 Difference]: Finished difference Result 102 states and 122 transitions. [2024-09-12 19:51:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:51:01,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-09-12 19:51:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:01,443 INFO L225 Difference]: With dead ends: 102 [2024-09-12 19:51:01,443 INFO L226 Difference]: Without dead ends: 100 [2024-09-12 19:51:01,444 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-09-12 19:51:01,444 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 34 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:01,445 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 184 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:51:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-09-12 19:51:01,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2024-09-12 19:51:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.1875) internal successors, (76), 67 states have internal predecessors, (76), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2024-09-12 19:51:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2024-09-12 19:51:01,471 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 26 [2024-09-12 19:51:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:01,475 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2024-09-12 19:51:01,475 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 19:51:01,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:01,476 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2024-09-12 19:51:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 19:51:01,477 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:01,477 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-12 19:51:01,482 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-12 19:51:01,678 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-12 19:51:01,678 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:01,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:01,679 INFO L85 PathProgramCache]: Analyzing trace with hash -56694378, now seen corresponding path program 1 times [2024-09-12 19:51:01,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738745366] [2024-09-12 19:51:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:01,679 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-12 19:51:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:01,682 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-12 19:51:01,683 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-12 19:51:01,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:01,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-09-12 19:51:01,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:02,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:51:02,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:03,794 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-12 19:51:03,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:03,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738745366] [2024-09-12 19:51:03,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738745366] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:51:03,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:51:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2024-09-12 19:51:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614402410] [2024-09-12 19:51:03,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:51:03,795 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 19:51:03,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:03,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 19:51:03,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2024-09-12 19:51:03,796 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand has 26 states, 23 states have (on average 1.826086956521739) internal successors, (42), 20 states have internal predecessors, (42), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:51:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:05,630 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2024-09-12 19:51:05,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-09-12 19:51:05,631 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 1.826086956521739) internal successors, (42), 20 states have internal predecessors, (42), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2024-09-12 19:51:05,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:05,632 INFO L225 Difference]: With dead ends: 138 [2024-09-12 19:51:05,632 INFO L226 Difference]: Without dead ends: 131 [2024-09-12 19:51:05,634 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2024-09-12 19:51:05,635 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:05,635 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 343 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-09-12 19:51:05,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-09-12 19:51:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2024-09-12 19:51:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.170731707317073) internal successors, (96), 85 states have internal predecessors, (96), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (21), 17 states have call predecessors, (21), 16 states have call successors, (21) [2024-09-12 19:51:05,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2024-09-12 19:51:05,678 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 30 [2024-09-12 19:51:05,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:05,679 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2024-09-12 19:51:05,679 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 1.826086956521739) internal successors, (42), 20 states have internal predecessors, (42), 6 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:51:05,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:05,681 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2024-09-12 19:51:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 19:51:05,682 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:05,683 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, 1] [2024-09-12 19:51:05,689 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 (7)] Forceful destruction successful, exit code 0 [2024-09-12 19:51:05,883 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-12 19:51:05,884 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:05,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:05,884 INFO L85 PathProgramCache]: Analyzing trace with hash 73393056, now seen corresponding path program 1 times [2024-09-12 19:51:05,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:05,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462770058] [2024-09-12 19:51:05,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:05,884 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-12 19:51:05,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:05,886 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-12 19:51:05,886 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-12 19:51:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:05,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 19:51:05,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:05,946 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-12 19:51:05,947 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:51:05,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462770058] [2024-09-12 19:51:05,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462770058] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:51:05,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 19:51:05,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 19:51:05,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248329304] [2024-09-12 19:51:05,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:51:05,948 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 19:51:05,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:05,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 19:51:05,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-12 19:51:05,948 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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-12 19:51:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:05,988 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2024-09-12 19:51:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 19:51:05,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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 31 [2024-09-12 19:51:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:05,990 INFO L225 Difference]: With dead ends: 131 [2024-09-12 19:51:05,990 INFO L226 Difference]: Without dead ends: 113 [2024-09-12 19:51:05,991 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-12 19:51:05,991 INFO L434 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 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-12 19:51:05,992 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 19:51:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-09-12 19:51:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-09-12 19:51:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 85 states have internal predecessors, (93), 17 states have call successors, (17), 10 states have call predecessors, (17), 12 states have return successors, (21), 17 states have call predecessors, (21), 16 states have call successors, (21) [2024-09-12 19:51:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2024-09-12 19:51:06,043 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 31 [2024-09-12 19:51:06,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:06,043 INFO L474 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2024-09-12 19:51:06,043 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 3 states have internal predecessors, (20), 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-12 19:51:06,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2024-09-12 19:51:06,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-09-12 19:51:06,049 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:06,049 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-12 19:51:06,053 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 (8)] Forceful destruction successful, exit code 0 [2024-09-12 19:51:06,249 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-12 19:51:06,250 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:06,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:06,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1719168918, now seen corresponding path program 1 times [2024-09-12 19:51:06,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:06,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117429924] [2024-09-12 19:51:06,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:06,251 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-12 19:51:06,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:06,254 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-12 19:51:06,255 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-12 19:51:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:06,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:51:06,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:51:06,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:06,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:06,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117429924] [2024-09-12 19:51:06,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117429924] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:51:06,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1451082388] [2024-09-12 19:51:06,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:06,801 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 19:51:06,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 19:51:06,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-12 19:51:06,824 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-09-12 19:51:06,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:06,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-09-12 19:51:06,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:07,061 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-12 19:51:07,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 19:51:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1451082388] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 19:51:07,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 19:51:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 16 [2024-09-12 19:51:07,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523121737] [2024-09-12 19:51:07,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:51:07,062 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:51:07,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:07,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:51:07,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2024-09-12 19:51:07,063 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:51:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:07,412 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2024-09-12 19:51:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 19:51:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2024-09-12 19:51:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:07,414 INFO L225 Difference]: With dead ends: 144 [2024-09-12 19:51:07,415 INFO L226 Difference]: Without dead ends: 138 [2024-09-12 19:51:07,415 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2024-09-12 19:51:07,416 INFO L434 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:07,416 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 161 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:51:07,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-09-12 19:51:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-09-12 19:51:07,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 94 states have (on average 1.1170212765957446) internal successors, (105), 97 states have internal predecessors, (105), 19 states have call successors, (19), 11 states have call predecessors, (19), 15 states have return successors, (27), 21 states have call predecessors, (27), 18 states have call successors, (27) [2024-09-12 19:51:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2024-09-12 19:51:07,456 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 31 [2024-09-12 19:51:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:07,456 INFO L474 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2024-09-12 19:51:07,456 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 19:51:07,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2024-09-12 19:51:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-09-12 19:51:07,458 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:07,458 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-12 19:51:07,461 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-12 19:51:07,661 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-09-12 19:51:07,859 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,10 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-12 19:51:07,859 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:07,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:07,859 INFO L85 PathProgramCache]: Analyzing trace with hash 302218996, now seen corresponding path program 1 times [2024-09-12 19:51:07,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:07,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874416202] [2024-09-12 19:51:07,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:07,860 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-12 19:51:07,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:07,861 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-12 19:51:07,862 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-12 19:51:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:07,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-09-12 19:51:07,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:51:08,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:51:08,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:08,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874416202] [2024-09-12 19:51:08,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874416202] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:51:08,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:51:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2024-09-12 19:51:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299413487] [2024-09-12 19:51:08,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:51:08,696 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-09-12 19:51:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:08,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-09-12 19:51:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-09-12 19:51:08,702 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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-12 19:51:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:09,100 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2024-09-12 19:51:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 19:51:09,102 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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 32 [2024-09-12 19:51:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:09,103 INFO L225 Difference]: With dead ends: 143 [2024-09-12 19:51:09,103 INFO L226 Difference]: Without dead ends: 116 [2024-09-12 19:51:09,103 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-09-12 19:51:09,104 INFO L434 NwaCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:09,104 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 167 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:51:09,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-09-12 19:51:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2024-09-12 19:51:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 80 states have internal predecessors, (87), 16 states have call successors, (16), 9 states have call predecessors, (16), 12 states have return successors, (23), 18 states have call predecessors, (23), 15 states have call successors, (23) [2024-09-12 19:51:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2024-09-12 19:51:09,133 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 32 [2024-09-12 19:51:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:09,133 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2024-09-12 19:51:09,133 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 19 states have internal predecessors, (38), 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-12 19:51:09,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2024-09-12 19:51:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 19:51:09,135 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:09,135 INFO L216 NwaCegarLoop]: trace histogram [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-12 19:51:09,138 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-12 19:51:09,335 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-12 19:51:09,335 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:09,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash -628855282, now seen corresponding path program 1 times [2024-09-12 19:51:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:09,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796023115] [2024-09-12 19:51:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:09,336 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-12 19:51:09,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:09,337 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-12 19:51:09,339 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-12 19:51:09,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:09,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-09-12 19:51:09,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 19:51:09,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:10,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 19:51:10,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:10,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796023115] [2024-09-12 19:51:10,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796023115] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:51:10,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:51:10,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2024-09-12 19:51:10,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76217850] [2024-09-12 19:51:10,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:51:10,414 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-09-12 19:51:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:10,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-09-12 19:51:10,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2024-09-12 19:51:10,415 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 25 states, 22 states have (on average 2.272727272727273) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:51:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:11,887 INFO L93 Difference]: Finished difference Result 189 states and 225 transitions. [2024-09-12 19:51:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-09-12 19:51:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.272727272727273) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2024-09-12 19:51:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:11,890 INFO L225 Difference]: With dead ends: 189 [2024-09-12 19:51:11,890 INFO L226 Difference]: Without dead ends: 180 [2024-09-12 19:51:11,891 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=173, Invalid=1159, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 19:51:11,891 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 136 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:11,891 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 332 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-09-12 19:51:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-09-12 19:51:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 152. [2024-09-12 19:51:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 111 states have (on average 1.117117117117117) internal successors, (124), 113 states have internal predecessors, (124), 21 states have call successors, (21), 13 states have call predecessors, (21), 18 states have return successors, (32), 25 states have call predecessors, (32), 20 states have call successors, (32) [2024-09-12 19:51:11,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2024-09-12 19:51:11,936 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 37 [2024-09-12 19:51:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:11,936 INFO L474 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2024-09-12 19:51:11,938 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.272727272727273) internal successors, (50), 17 states have internal predecessors, (50), 6 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2024-09-12 19:51:11,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2024-09-12 19:51:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 19:51:11,940 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:11,940 INFO L216 NwaCegarLoop]: trace histogram [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-12 19:51:11,944 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-12 19:51:12,140 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-12 19:51:12,141 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:12,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1016652878, now seen corresponding path program 1 times [2024-09-12 19:51:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:12,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772435093] [2024-09-12 19:51:12,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:12,142 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-12 19:51:12,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:12,143 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-12 19:51:12,144 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-12 19:51:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:12,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-09-12 19:51:12,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:51:12,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:12,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772435093] [2024-09-12 19:51:12,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772435093] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:51:12,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [5412000] [2024-09-12 19:51:12,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:12,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 19:51:12,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 19:51:12,781 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-12 19:51:12,782 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-12 19:51:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:12,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 19:51:12,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:51:13,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:13,204 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 19:51:13,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [5412000] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 19:51:13,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 19:51:13,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2024-09-12 19:51:13,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664493890] [2024-09-12 19:51:13,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 19:51:13,205 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-09-12 19:51:13,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:13,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-09-12 19:51:13,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=793, Unknown=0, NotChecked=0, Total=870 [2024-09-12 19:51:13,206 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 14 states have internal predecessors, (46), 8 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:51:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:13,760 INFO L93 Difference]: Finished difference Result 172 states and 201 transitions. [2024-09-12 19:51:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-09-12 19:51:13,762 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 14 states have internal predecessors, (46), 8 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2024-09-12 19:51:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:13,764 INFO L225 Difference]: With dead ends: 172 [2024-09-12 19:51:13,764 INFO L226 Difference]: Without dead ends: 143 [2024-09-12 19:51:13,765 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=139, Invalid=1267, Unknown=0, NotChecked=0, Total=1406 [2024-09-12 19:51:13,765 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:13,766 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 401 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-09-12 19:51:13,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-09-12 19:51:13,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2024-09-12 19:51:13,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.1287128712871286) internal successors, (114), 103 states have internal predecessors, (114), 19 states have call successors, (19), 12 states have call predecessors, (19), 16 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2024-09-12 19:51:13,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2024-09-12 19:51:13,807 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 37 [2024-09-12 19:51:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:13,807 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2024-09-12 19:51:13,807 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 14 states have internal predecessors, (46), 8 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-09-12 19:51:13,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2024-09-12 19:51:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 19:51:13,809 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:13,809 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] [2024-09-12 19:51:13,814 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-12 19:51:14,012 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-12 19:51:14,210 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-12 19:51:14,210 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:14,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:14,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1238611092, now seen corresponding path program 1 times [2024-09-12 19:51:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:14,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883719565] [2024-09-12 19:51:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:14,211 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-12 19:51:14,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:14,212 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-12 19:51:14,214 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-12 19:51:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:14,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 19:51:14,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 19:51:14,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:15,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:15,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883719565] [2024-09-12 19:51:15,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883719565] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:51:15,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1324904060] [2024-09-12 19:51:15,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:15,010 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 19:51:15,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 19:51:15,013 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-12 19:51:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-09-12 19:51:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:15,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-09-12 19:51:15,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:51:15,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-09-12 19:51:16,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1324904060] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 19:51:16,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:51:16,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14, 15] total 33 [2024-09-12 19:51:16,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990776450] [2024-09-12 19:51:16,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 19:51:16,339 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-12 19:51:16,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:16,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-12 19:51:16,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1219, Unknown=0, NotChecked=0, Total=1332 [2024-09-12 19:51:16,340 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:51:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:16,760 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2024-09-12 19:51:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 19:51:16,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2024-09-12 19:51:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:16,762 INFO L225 Difference]: With dead ends: 176 [2024-09-12 19:51:16,763 INFO L226 Difference]: Without dead ends: 175 [2024-09-12 19:51:16,763 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=127, Invalid=1433, Unknown=0, NotChecked=0, Total=1560 [2024-09-12 19:51:16,764 INFO L434 NwaCegarLoop]: 32 mSDtfsCounter, 26 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:16,764 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 229 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 19:51:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-09-12 19:51:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2024-09-12 19:51:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 113 states have (on average 1.1150442477876106) internal successors, (126), 115 states have internal predecessors, (126), 21 states have call successors, (21), 13 states have call predecessors, (21), 19 states have return successors, (34), 26 states have call predecessors, (34), 20 states have call successors, (34) [2024-09-12 19:51:16,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2024-09-12 19:51:16,808 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 41 [2024-09-12 19:51:16,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:16,808 INFO L474 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2024-09-12 19:51:16,809 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-09-12 19:51:16,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:16,809 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2024-09-12 19:51:16,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-09-12 19:51:16,810 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:16,810 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, 1] [2024-09-12 19:51:16,813 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2024-09-12 19:51:17,013 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 (15)] Ended with exit code 0 [2024-09-12 19:51:17,210 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt,15 /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-12 19:51:17,211 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:17,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1984108972, now seen corresponding path program 1 times [2024-09-12 19:51:17,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:17,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982589853] [2024-09-12 19:51:17,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:17,211 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-12 19:51:17,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:17,213 INFO L229 MonitoredProcess]: Starting monitored process 17 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-12 19:51:17,214 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 (17)] Waiting until timeout for monitored process [2024-09-12 19:51:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:17,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-09-12 19:51:17,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:17,381 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-12 19:51:17,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:17,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-09-12 19:51:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982589853] [2024-09-12 19:51:17,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982589853] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:51:17,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562180192] [2024-09-12 19:51:17,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:17,817 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-09-12 19:51:17,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/cvc4 [2024-09-12 19:51:17,818 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-09-12 19:51:17,819 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2024-09-12 19:51:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:17,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-09-12 19:51:17,889 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:18,542 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-12 19:51:18,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 19:51:19,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1562180192] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 19:51:19,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-12 19:51:19,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 25 [2024-09-12 19:51:19,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271745596] [2024-09-12 19:51:19,047 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-12 19:51:19,048 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-12 19:51:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-09-12 19:51:19,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-12 19:51:19,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1082, Unknown=0, NotChecked=0, Total=1190 [2024-09-12 19:51:19,049 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 26 states, 23 states have (on average 2.391304347826087) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-12 19:51:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 19:51:20,110 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2024-09-12 19:51:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 19:51:20,111 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.391304347826087) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 41 [2024-09-12 19:51:20,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 19:51:20,112 INFO L225 Difference]: With dead ends: 193 [2024-09-12 19:51:20,112 INFO L226 Difference]: Without dead ends: 192 [2024-09-12 19:51:20,113 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=267, Invalid=2183, Unknown=0, NotChecked=0, Total=2450 [2024-09-12 19:51:20,114 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 46 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-09-12 19:51:20,114 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 502 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-09-12 19:51:20,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-09-12 19:51:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 138. [2024-09-12 19:51:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 101 states have (on average 1.108910891089109) internal successors, (112), 103 states have internal predecessors, (112), 19 states have call successors, (19), 12 states have call predecessors, (19), 16 states have return successors, (28), 22 states have call predecessors, (28), 18 states have call successors, (28) [2024-09-12 19:51:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 159 transitions. [2024-09-12 19:51:20,162 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 159 transitions. Word has length 41 [2024-09-12 19:51:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 19:51:20,163 INFO L474 AbstractCegarLoop]: Abstraction has 138 states and 159 transitions. [2024-09-12 19:51:20,163 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.391304347826087) internal successors, (55), 18 states have internal predecessors, (55), 8 states have call successors, (10), 3 states have call predecessors, (10), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-09-12 19:51:20,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 159 transitions. [2024-09-12 19:51:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 19:51:20,165 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 19:51:20,165 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] [2024-09-12 19:51:20,168 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 (17)] Ended with exit code 0 [2024-09-12 19:51:20,368 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2024-09-12 19:51:20,565 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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,18 /storage/repos/certificate-witnesses-artifact/automizer/cvc4 --incremental --print-success --lang smt [2024-09-12 19:51:20,566 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [dividesErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dividesErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, gcdErr0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2024-09-12 19:51:20,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 19:51:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 598622944, now seen corresponding path program 1 times [2024-09-12 19:51:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-09-12 19:51:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796258308] [2024-09-12 19:51:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 19:51:20,566 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-12 19:51:20,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/mathsat [2024-09-12 19:51:20,567 INFO L229 MonitoredProcess]: Starting monitored process 19 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-12 19:51:20,568 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 (19)] Waiting until timeout for monitored process [2024-09-12 19:51:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 19:51:20,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-12 19:51:20,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 19:51:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-09-12 19:51:21,279 INFO L327 TraceCheckSpWp]: Computing backward predicates...