./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-2-2.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/loops/insertion_sort-2-2.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 f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 --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 17:50:16,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-12 17:50:16,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-12 17:50:16,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-12 17:50:16,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-12 17:50:16,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-12 17:50:16,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-12 17:50:16,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-12 17:50:16,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-12 17:50:16,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-12 17:50:16,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-12 17:50:16,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-12 17:50:16,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-12 17:50:16,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-12 17:50:16,691 INFO L153 SettingsManager]: * Use SBE=true [2024-09-12 17:50:16,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-12 17:50:16,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-12 17:50:16,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-12 17:50:16,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-12 17:50:16,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-12 17:50:16,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-12 17:50:16,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-12 17:50:16,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-12 17:50:16,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-12 17:50:16,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-12 17:50:16,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-12 17:50:16,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-12 17:50:16,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-12 17:50:16,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-12 17:50:16,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-12 17:50:16,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-12 17:50:16,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-12 17:50:16,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:50:16,694 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-12 17:50:16,694 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-12 17:50:16,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-12 17:50:16,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-12 17:50:16,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-12 17:50:16,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-12 17:50:16,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-12 17:50:16,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-12 17:50:16,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-12 17:50:16,698 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 -> f08b02f494e898be2e8c5098de245f701022f3f8b39ac6682b3bca3a03512826 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 17:50:16,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-12 17:50:16,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-12 17:50:16,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-12 17:50:16,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-12 17:50:16,986 INFO L274 PluginConnector]: CDTParser initialized [2024-09-12 17:50:16,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-12 17:50:18,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-12 17:50:18,594 INFO L384 CDTParser]: Found 1 translation units. [2024-09-12 17:50:18,595 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/loops/insertion_sort-2-2.c [2024-09-12 17:50:18,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/a7fd34887/0f40b5c6ef0c407dafe0eab94c7b1872/FLAGd185b50e0 [2024-09-12 17:50:18,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/a7fd34887/0f40b5c6ef0c407dafe0eab94c7b1872 [2024-09-12 17:50:18,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-12 17:50:18,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-12 17:50:18,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-12 17:50:18,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-12 17:50:18,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-12 17:50:18,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@744be355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18, skipping insertion in model container [2024-09-12 17:50:18,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-12 17:50:18,774 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/loops/insertion_sort-2-2.c[330,343] [2024-09-12 17:50:18,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:50:18,811 INFO L200 MainTranslator]: Completed pre-run [2024-09-12 17:50:18,833 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/loops/insertion_sort-2-2.c[330,343] [2024-09-12 17:50:18,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-12 17:50:18,862 INFO L204 MainTranslator]: Completed translation [2024-09-12 17:50:18,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18 WrapperNode [2024-09-12 17:50:18,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-12 17:50:18,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-12 17:50:18,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-12 17:50:18,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-12 17:50:18,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,886 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-12 17:50:18,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-12 17:50:18,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-12 17:50:18,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-12 17:50:18,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-12 17:50:18,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,908 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 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-09-12 17:50:18,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-12 17:50:18,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-12 17:50:18,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-12 17:50:18,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-12 17:50:18,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (1/1) ... [2024-09-12 17:50:18,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-12 17:50:18,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:18,951 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 17:50:18,957 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 17:50:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-12 17:50:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-12 17:50:18,988 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-12 17:50:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-12 17:50:18,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-09-12 17:50:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-09-12 17:50:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-09-12 17:50:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-09-12 17:50:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-12 17:50:18,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-12 17:50:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-12 17:50:18,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-12 17:50:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-09-12 17:50:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-09-12 17:50:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-12 17:50:18,991 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-12 17:50:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-09-12 17:50:19,054 INFO L242 CfgBuilder]: Building ICFG [2024-09-12 17:50:19,056 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-12 17:50:19,297 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-09-12 17:50:19,298 INFO L291 CfgBuilder]: Performing block encoding [2024-09-12 17:50:19,323 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-12 17:50:19,324 INFO L318 CfgBuilder]: Removed 4 assume(true) statements. [2024-09-12 17:50:19,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:50:19 BoogieIcfgContainer [2024-09-12 17:50:19,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-12 17:50:19,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-12 17:50:19,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-12 17:50:19,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-12 17:50:19,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.09 05:50:18" (1/3) ... [2024-09-12 17:50:19,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51da44fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:50:19, skipping insertion in model container [2024-09-12 17:50:19,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.09 05:50:18" (2/3) ... [2024-09-12 17:50:19,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51da44fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.09 05:50:19, skipping insertion in model container [2024-09-12 17:50:19,335 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.09 05:50:19" (3/3) ... [2024-09-12 17:50:19,336 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort-2-2.c [2024-09-12 17:50:19,349 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-12 17:50:19,349 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-09-12 17:50:19,395 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-12 17:50:19,400 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;@bf193ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-12 17:50:19,401 INFO L337 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-09-12 17:50:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.8) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-09-12 17:50:19,409 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:19,409 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:19,418 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:19,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash -415259263, now seen corresponding path program 1 times [2024-09-12 17:50:19,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151369034] [2024-09-12 17:50:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:19,652 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:19,662 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 17:50:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:19,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151369034] [2024-09-12 17:50:19,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151369034] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:19,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:19,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:19,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649300259] [2024-09-12 17:50:19,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:19,668 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:19,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:19,688 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.8) internal successors, (63), 52 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:19,738 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2024-09-12 17:50:19,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:19,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 8 [2024-09-12 17:50:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:19,746 INFO L225 Difference]: With dead ends: 112 [2024-09-12 17:50:19,746 INFO L226 Difference]: Without dead ends: 57 [2024-09-12 17:50:19,749 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:50:19,751 INFO L434 NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:19,752 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 163 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-09-12 17:50:19,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-09-12 17:50:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 51 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:19,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-09-12 17:50:19,788 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 8 [2024-09-12 17:50:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:19,789 INFO L474 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-09-12 17:50:19,789 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:19,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:19,790 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-09-12 17:50:19,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-09-12 17:50:19,791 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:19,791 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:19,791 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-12 17:50:19,791 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:19,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash 364477881, now seen corresponding path program 1 times [2024-09-12 17:50:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086001240] [2024-09-12 17:50:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:19,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:19,870 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:19,877 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 17:50:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086001240] [2024-09-12 17:50:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086001240] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:19,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 17:50:19,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229320697] [2024-09-12 17:50:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:19,883 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:50:19,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:19,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:50:19,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:50:19,884 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:19,928 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2024-09-12 17:50:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:50:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-09-12 17:50:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:19,931 INFO L225 Difference]: With dead ends: 77 [2024-09-12 17:50:19,931 INFO L226 Difference]: Without dead ends: 75 [2024-09-12 17:50:19,932 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 17:50:19,933 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:19,935 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:19,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-09-12 17:50:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2024-09-12 17:50:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.605263157894737) internal successors, (61), 54 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2024-09-12 17:50:19,947 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 10 [2024-09-12 17:50:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:19,949 INFO L474 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2024-09-12 17:50:19,949 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:19,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2024-09-12 17:50:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-09-12 17:50:19,950 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:19,951 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:19,951 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-12 17:50:19,951 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:19,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1482840667, now seen corresponding path program 1 times [2024-09-12 17:50:19,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:19,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399040989] [2024-09-12 17:50:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,092 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:20,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:20,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399040989] [2024-09-12 17:50:20,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399040989] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000855189] [2024-09-12 17:50:20,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:20,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:20,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:20,106 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 17:50:20,111 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 17:50:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 17:50:20,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:20,271 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 17:50:20,271 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:50:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000855189] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:20,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:50:20,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-09-12 17:50:20,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065520531] [2024-09-12 17:50:20,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:20,273 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-12 17:50:20,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-12 17:50:20,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:50:20,275 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:20,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:20,333 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2024-09-12 17:50:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-12 17:50:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-09-12 17:50:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:20,335 INFO L225 Difference]: With dead ends: 75 [2024-09-12 17:50:20,335 INFO L226 Difference]: Without dead ends: 74 [2024-09-12 17:50:20,337 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-12 17:50:20,338 INFO L434 NwaCegarLoop]: 46 mSDtfsCounter, 39 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:20,338 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-09-12 17:50:20,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2024-09-12 17:50:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 53 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2024-09-12 17:50:20,349 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 11 [2024-09-12 17:50:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:20,349 INFO L474 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2024-09-12 17:50:20,350 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:20,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2024-09-12 17:50:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 17:50:20,351 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:20,351 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:20,363 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-09-12 17:50:20,555 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:20,556 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:20,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1924089272, now seen corresponding path program 1 times [2024-09-12 17:50:20,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:20,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035523495] [2024-09-12 17:50:20,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:20,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,589 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,591 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 17:50:20,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:20,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035523495] [2024-09-12 17:50:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035523495] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-12 17:50:20,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017015920] [2024-09-12 17:50:20,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:20,592 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-12 17:50:20,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-12 17:50:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-12 17:50:20,593 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:20,623 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-09-12 17:50:20,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-12 17:50:20,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 17:50:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:20,625 INFO L225 Difference]: With dead ends: 66 [2024-09-12 17:50:20,625 INFO L226 Difference]: Without dead ends: 64 [2024-09-12 17:50:20,626 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 17:50:20,628 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:20,629 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-09-12 17:50:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2024-09-12 17:50:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 56 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2024-09-12 17:50:20,641 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 12 [2024-09-12 17:50:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:20,642 INFO L474 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2024-09-12 17:50:20,642 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:20,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2024-09-12 17:50:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-09-12 17:50:20,644 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:20,644 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:20,645 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-12 17:50:20,645 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:20,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1276579627, now seen corresponding path program 1 times [2024-09-12 17:50:20,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:20,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681943284] [2024-09-12 17:50:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:20,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,733 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:20,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681943284] [2024-09-12 17:50:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681943284] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105169971] [2024-09-12 17:50:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:20,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:20,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:20,740 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 17:50:20,747 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 17:50:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:20,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 17:50:20,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:20,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:20,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105169971] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:20,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-09-12 17:50:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724614231] [2024-09-12 17:50:20,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:20,874 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 17:50:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 17:50:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:50:20,875 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:20,953 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-09-12 17:50:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-12 17:50:20,954 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 17:50:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:20,955 INFO L225 Difference]: With dead ends: 87 [2024-09-12 17:50:20,955 INFO L226 Difference]: Without dead ends: 86 [2024-09-12 17:50:20,956 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:50:20,956 INFO L434 NwaCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:20,956 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 369 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:20,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-09-12 17:50:20,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2024-09-12 17:50:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.5) internal successors, (75), 65 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-09-12 17:50:20,962 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 12 [2024-09-12 17:50:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:20,962 INFO L474 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-09-12 17:50:20,962 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 12 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:20,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:20,963 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-09-12 17:50:20,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-09-12 17:50:20,963 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:20,963 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:20,975 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-12 17:50:21,164 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:21,165 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:21,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash 587432921, now seen corresponding path program 1 times [2024-09-12 17:50:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:21,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451966295] [2024-09-12 17:50:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,193 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,196 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 17:50:21,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:21,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451966295] [2024-09-12 17:50:21,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451966295] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:21,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:21,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:21,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019168995] [2024-09-12 17:50:21,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:21,201 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:21,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:21,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:21,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:21,202 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:21,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:21,257 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2024-09-12 17:50:21,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:21,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 17:50:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:21,259 INFO L225 Difference]: With dead ends: 98 [2024-09-12 17:50:21,259 INFO L226 Difference]: Without dead ends: 95 [2024-09-12 17:50:21,259 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:50:21,260 INFO L434 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:21,260 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 119 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-09-12 17:50:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2024-09-12 17:50:21,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 72 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2024-09-12 17:50:21,266 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 15 [2024-09-12 17:50:21,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:21,266 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2024-09-12 17:50:21,266 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:21,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2024-09-12 17:50:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-09-12 17:50:21,267 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:21,267 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:21,268 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-12 17:50:21,268 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:21,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash 732273381, now seen corresponding path program 1 times [2024-09-12 17:50:21,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:21,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480305487] [2024-09-12 17:50:21,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,344 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,348 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 17:50:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:21,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480305487] [2024-09-12 17:50:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480305487] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:21,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:21,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:50:21,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150986962] [2024-09-12 17:50:21,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:21,350 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:50:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:50:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:50:21,350 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17:50:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:21,393 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2024-09-12 17:50:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:50:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17 [2024-09-12 17:50:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:21,394 INFO L225 Difference]: With dead ends: 136 [2024-09-12 17:50:21,394 INFO L226 Difference]: Without dead ends: 78 [2024-09-12 17:50:21,394 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:50:21,395 INFO L434 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:21,395 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-09-12 17:50:21,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-09-12 17:50:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 72 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-09-12 17:50:21,401 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 17 [2024-09-12 17:50:21,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:21,401 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-09-12 17:50:21,401 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 17:50:21,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,401 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-09-12 17:50:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 17:50:21,402 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:21,402 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 17:50:21,402 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-12 17:50:21,402 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:21,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1331397441, now seen corresponding path program 1 times [2024-09-12 17:50:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:21,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525615365] [2024-09-12 17:50:21,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,508 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:21,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525615365] [2024-09-12 17:50:21,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525615365] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:21,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698233055] [2024-09-12 17:50:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:21,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:21,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:21,513 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 17:50:21,514 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 17:50:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 17:50:21,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:21,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:50:21,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698233055] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:21,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:50:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2024-09-12 17:50:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761146466] [2024-09-12 17:50:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:21,603 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:50:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:50:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:50:21,603 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 17:50:21,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:21,631 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2024-09-12 17:50:21,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:50:21,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 20 [2024-09-12 17:50:21,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:21,632 INFO L225 Difference]: With dead ends: 114 [2024-09-12 17:50:21,632 INFO L226 Difference]: Without dead ends: 93 [2024-09-12 17:50:21,633 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:50:21,633 INFO L434 NwaCegarLoop]: 50 mSDtfsCounter, 19 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:21,634 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 139 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-09-12 17:50:21,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2024-09-12 17:50:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 57 states have (on average 1.456140350877193) internal successors, (83), 72 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:21,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2024-09-12 17:50:21,644 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 20 [2024-09-12 17:50:21,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:21,644 INFO L474 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2024-09-12 17:50:21,644 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 17:50:21,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2024-09-12 17:50:21,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-09-12 17:50:21,645 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:21,645 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:21,659 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 17:50:21,845 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-09-12 17:50:21,847 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:21,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1721068598, now seen corresponding path program 1 times [2024-09-12 17:50:21,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:21,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290218612] [2024-09-12 17:50:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:21,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,885 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:21,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:21,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290218612] [2024-09-12 17:50:21,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290218612] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:21,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:21,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:21,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402213711] [2024-09-12 17:50:21,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:21,889 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:21,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:21,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:21,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:21,889 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:21,940 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-09-12 17:50:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 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 17:50:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:21,942 INFO L225 Difference]: With dead ends: 93 [2024-09-12 17:50:21,942 INFO L226 Difference]: Without dead ends: 90 [2024-09-12 17:50:21,942 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:50:21,942 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:21,943 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 121 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-09-12 17:50:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-09-12 17:50:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 81 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2024-09-12 17:50:21,949 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 19 [2024-09-12 17:50:21,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:21,949 INFO L474 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2024-09-12 17:50:21,949 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:21,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2024-09-12 17:50:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-09-12 17:50:21,949 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:21,949 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 17:50:21,949 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-12 17:50:21,950 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:21,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:21,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1813517089, now seen corresponding path program 1 times [2024-09-12 17:50:21,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:21,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142614272] [2024-09-12 17:50:21,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:21,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,982 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:21,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:21,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:21,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:21,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142614272] [2024-09-12 17:50:21,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142614272] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:21,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:21,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:21,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244921884] [2024-09-12 17:50:21,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:21,985 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:21,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:21,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:21,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:21,986 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:22,033 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2024-09-12 17:50:22,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:22,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-09-12 17:50:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:22,034 INFO L225 Difference]: With dead ends: 94 [2024-09-12 17:50:22,034 INFO L226 Difference]: Without dead ends: 92 [2024-09-12 17:50:22,035 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 17:50:22,038 INFO L434 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:22,039 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:22,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-09-12 17:50:22,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 89. [2024-09-12 17:50:22,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 83 states have internal predecessors, (98), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2024-09-12 17:50:22,058 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 20 [2024-09-12 17:50:22,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:22,059 INFO L474 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2024-09-12 17:50:22,059 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:22,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:22,059 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2024-09-12 17:50:22,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-09-12 17:50:22,060 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:22,060 INFO L216 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:22,060 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-12 17:50:22,060 INFO L399 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:22,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:22,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1476644815, now seen corresponding path program 2 times [2024-09-12 17:50:22,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:22,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026590388] [2024-09-12 17:50:22,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:22,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,177 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:22,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026590388] [2024-09-12 17:50:22,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026590388] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407983281] [2024-09-12 17:50:22,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:50:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:22,183 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 17:50:22,184 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 17:50:22,239 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 17:50:22,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:50:22,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-12 17:50:22,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:22,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:22,415 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407983281] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:22,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:22,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-09-12 17:50:22,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172845198] [2024-09-12 17:50:22,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:22,416 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-09-12 17:50:22,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:22,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-09-12 17:50:22,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-09-12 17:50:22,417 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:22,520 INFO L93 Difference]: Finished difference Result 111 states and 133 transitions. [2024-09-12 17:50:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-09-12 17:50:22,520 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-09-12 17:50:22,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:22,521 INFO L225 Difference]: With dead ends: 111 [2024-09-12 17:50:22,521 INFO L226 Difference]: Without dead ends: 110 [2024-09-12 17:50:22,522 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-09-12 17:50:22,522 INFO L434 NwaCegarLoop]: 48 mSDtfsCounter, 80 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:22,522 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 412 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:22,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-09-12 17:50:22,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-09-12 17:50:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 101 states have internal predecessors, (122), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:22,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2024-09-12 17:50:22,529 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 21 [2024-09-12 17:50:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:22,529 INFO L474 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2024-09-12 17:50:22,529 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:22,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:22,530 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2024-09-12 17:50:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-12 17:50:22,530 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:22,530 INFO L216 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:22,554 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 17:50:22,734 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:22,735 INFO L399 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:22,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:22,735 INFO L85 PathProgramCache]: Analyzing trace with hash -93883032, now seen corresponding path program 1 times [2024-09-12 17:50:22,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:22,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258591781] [2024-09-12 17:50:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:22,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,794 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258591781] [2024-09-12 17:50:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258591781] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828580277] [2024-09-12 17:50:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:22,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:22,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:22,798 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 17:50:22,806 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 17:50:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:22,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 17:50:22,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:22,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:50:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828580277] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:22,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:50:22,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-09-12 17:50:22,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808357922] [2024-09-12 17:50:22,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:22,898 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:50:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:50:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:50:22,899 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:22,932 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2024-09-12 17:50:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:50:22,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-09-12 17:50:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:22,933 INFO L225 Difference]: With dead ends: 110 [2024-09-12 17:50:22,933 INFO L226 Difference]: Without dead ends: 108 [2024-09-12 17:50:22,933 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:50:22,933 INFO L434 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:22,934 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 151 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-09-12 17:50:22,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-09-12 17:50:22,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 99 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2024-09-12 17:50:22,946 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 23 [2024-09-12 17:50:22,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:22,947 INFO L474 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2024-09-12 17:50:22,947 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:22,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:22,947 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2024-09-12 17:50:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-09-12 17:50:22,948 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:22,948 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] [2024-09-12 17:50:22,963 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-09-12 17:50:23,148 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-09-12 17:50:23,149 INFO L399 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:23,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1384593368, now seen corresponding path program 1 times [2024-09-12 17:50:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235505217] [2024-09-12 17:50:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:23,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,220 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235505217] [2024-09-12 17:50:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235505217] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978346455] [2024-09-12 17:50:23,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:23,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:23,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:23,226 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 17:50:23,231 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 17:50:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 17:50:23,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:23,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:23,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:23,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978346455] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:23,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:23,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-09-12 17:50:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238452596] [2024-09-12 17:50:23,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:23,385 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 17:50:23,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 17:50:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:50:23,385 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:23,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:23,468 INFO L93 Difference]: Finished difference Result 126 states and 147 transitions. [2024-09-12 17:50:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-12 17:50:23,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-09-12 17:50:23,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:23,469 INFO L225 Difference]: With dead ends: 126 [2024-09-12 17:50:23,469 INFO L226 Difference]: Without dead ends: 125 [2024-09-12 17:50:23,470 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:50:23,470 INFO L434 NwaCegarLoop]: 43 mSDtfsCounter, 71 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:23,470 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 209 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-09-12 17:50:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2024-09-12 17:50:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 98 states have internal predecessors, (119), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2024-09-12 17:50:23,480 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 24 [2024-09-12 17:50:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:23,480 INFO L474 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2024-09-12 17:50:23,480 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:23,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2024-09-12 17:50:23,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-09-12 17:50:23,482 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:23,482 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] [2024-09-12 17:50:23,497 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-09-12 17:50:23,682 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-09-12 17:50:23,683 INFO L399 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:23,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:23,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1464584288, now seen corresponding path program 1 times [2024-09-12 17:50:23,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:23,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173724451] [2024-09-12 17:50:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:23,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,729 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:23,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:23,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173724451] [2024-09-12 17:50:23,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173724451] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:23,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:23,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463714644] [2024-09-12 17:50:23,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:23,732 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:23,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:23,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:23,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:23,732 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:23,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:23,771 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2024-09-12 17:50:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2024-09-12 17:50:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:23,772 INFO L225 Difference]: With dead ends: 115 [2024-09-12 17:50:23,772 INFO L226 Difference]: Without dead ends: 113 [2024-09-12 17:50:23,772 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:23,773 INFO L434 NwaCegarLoop]: 51 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:23,773 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 90 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-09-12 17:50:23,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2024-09-12 17:50:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 102 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2024-09-12 17:50:23,782 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 25 [2024-09-12 17:50:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:23,782 INFO L474 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2024-09-12 17:50:23,782 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:23,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2024-09-12 17:50:23,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-09-12 17:50:23,787 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:23,787 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:23,787 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-12 17:50:23,787 INFO L399 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:23,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1283720619, now seen corresponding path program 1 times [2024-09-12 17:50:23,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:23,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719260109] [2024-09-12 17:50:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,866 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 17:50:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719260109] [2024-09-12 17:50:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719260109] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:23,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:23,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:23,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798570884] [2024-09-12 17:50:23,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:23,869 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:23,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:23,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:23,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:23,870 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:23,903 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2024-09-12 17:50:23,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:23,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-09-12 17:50:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:23,905 INFO L225 Difference]: With dead ends: 118 [2024-09-12 17:50:23,905 INFO L226 Difference]: Without dead ends: 115 [2024-09-12 17:50:23,906 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:23,906 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:23,908 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-09-12 17:50:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2024-09-12 17:50:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 93 states have internal predecessors, (111), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2024-09-12 17:50:23,916 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 27 [2024-09-12 17:50:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:23,916 INFO L474 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2024-09-12 17:50:23,916 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:23,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2024-09-12 17:50:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-09-12 17:50:23,917 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:23,917 INFO L216 NwaCegarLoop]: trace histogram [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 17:50:23,917 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-12 17:50:23,917 INFO L399 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:23,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:23,918 INFO L85 PathProgramCache]: Analyzing trace with hash -904394484, now seen corresponding path program 1 times [2024-09-12 17:50:23,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:23,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689689979] [2024-09-12 17:50:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,956 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:50:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689689979] [2024-09-12 17:50:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689689979] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726719147] [2024-09-12 17:50:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:23,959 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:23,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:23,961 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:24,006 INFO L93 Difference]: Finished difference Result 113 states and 135 transitions. [2024-09-12 17:50:24,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:24,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2024-09-12 17:50:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:24,007 INFO L225 Difference]: With dead ends: 113 [2024-09-12 17:50:24,007 INFO L226 Difference]: Without dead ends: 112 [2024-09-12 17:50:24,007 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:50:24,008 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:24,008 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 95 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-09-12 17:50:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2024-09-12 17:50:24,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 88 states have internal predecessors, (104), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2024-09-12 17:50:24,017 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 28 [2024-09-12 17:50:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:24,017 INFO L474 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2024-09-12 17:50:24,017 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:24,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2024-09-12 17:50:24,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 17:50:24,020 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:24,020 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, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:24,020 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-12 17:50:24,020 INFO L399 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:24,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:24,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1603366998, now seen corresponding path program 1 times [2024-09-12 17:50:24,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:24,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693579171] [2024-09-12 17:50:24,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:24,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:24,142 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693579171] [2024-09-12 17:50:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693579171] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:24,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453126632] [2024-09-12 17:50:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:24,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:24,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:24,147 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 17:50:24,148 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 17:50:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:24,198 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-09-12 17:50:24,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:24,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-09-12 17:50:24,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-12 17:50:24,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:24,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-12 17:50:24,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:24,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:25,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453126632] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:25,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-09-12 17:50:25,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7, 14] total 28 [2024-09-12 17:50:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038457259] [2024-09-12 17:50:25,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:25,125 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 17:50:25,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:25,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 17:50:25,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-09-12 17:50:25,126 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:26,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:50:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:28,739 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2024-09-12 17:50:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-09-12 17:50:28,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-12 17:50:28,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:28,744 INFO L225 Difference]: With dead ends: 173 [2024-09-12 17:50:28,744 INFO L226 Difference]: Without dead ends: 171 [2024-09-12 17:50:28,746 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2024-09-12 17:50:28,746 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 87 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:28,746 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 313 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-09-12 17:50:28,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-09-12 17:50:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 123. [2024-09-12 17:50:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.320754716981132) internal successors, (140), 116 states have internal predecessors, (140), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2024-09-12 17:50:28,762 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 30 [2024-09-12 17:50:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:28,762 INFO L474 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2024-09-12 17:50:28,763 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:28,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2024-09-12 17:50:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-12 17:50:28,763 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:28,763 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] [2024-09-12 17:50:28,775 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 17:50:28,967 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-09-12 17:50:28,968 INFO L399 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:28,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:28,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2028482581, now seen corresponding path program 1 times [2024-09-12 17:50:28,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:28,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750040006] [2024-09-12 17:50:28,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:28,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,022 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:29,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750040006] [2024-09-12 17:50:29,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750040006] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:29,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126703435] [2024-09-12 17:50:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:29,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:29,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:29,028 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 17:50:29,032 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 17:50:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-09-12 17:50:29,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:29,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126703435] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:29,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:29,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-09-12 17:50:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418892562] [2024-09-12 17:50:29,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:29,193 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 17:50:29,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 17:50:29,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:50:29,194 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:29,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:29,331 INFO L93 Difference]: Finished difference Result 153 states and 191 transitions. [2024-09-12 17:50:29,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 17:50:29,331 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-09-12 17:50:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:29,333 INFO L225 Difference]: With dead ends: 153 [2024-09-12 17:50:29,333 INFO L226 Difference]: Without dead ends: 149 [2024-09-12 17:50:29,333 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-09-12 17:50:29,333 INFO L434 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:29,334 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 208 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-09-12 17:50:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2024-09-12 17:50:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.2592592592592593) internal successors, (170), 142 states have internal predecessors, (170), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2024-09-12 17:50:29,362 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 29 [2024-09-12 17:50:29,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:29,362 INFO L474 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2024-09-12 17:50:29,362 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:29,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2024-09-12 17:50:29,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-09-12 17:50:29,363 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:29,363 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, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:29,376 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 17:50:29,563 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,9 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:29,564 INFO L399 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:29,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 323503320, now seen corresponding path program 1 times [2024-09-12 17:50:29,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096079819] [2024-09-12 17:50:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:29,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,604 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:29,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:29,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096079819] [2024-09-12 17:50:29,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096079819] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:29,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:29,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-12 17:50:29,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813397730] [2024-09-12 17:50:29,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:29,607 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:50:29,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:29,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:50:29,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-09-12 17:50:29,608 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:29,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:29,686 INFO L93 Difference]: Finished difference Result 263 states and 311 transitions. [2024-09-12 17:50:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:50:29,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-09-12 17:50:29,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:29,688 INFO L225 Difference]: With dead ends: 263 [2024-09-12 17:50:29,688 INFO L226 Difference]: Without dead ends: 158 [2024-09-12 17:50:29,688 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-09-12 17:50:29,689 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:29,689 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 100 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:29,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-09-12 17:50:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2024-09-12 17:50:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 137 states have (on average 1.2554744525547445) internal successors, (172), 144 states have internal predecessors, (172), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 179 transitions. [2024-09-12 17:50:29,707 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 179 transitions. Word has length 30 [2024-09-12 17:50:29,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:29,708 INFO L474 AbstractCegarLoop]: Abstraction has 151 states and 179 transitions. [2024-09-12 17:50:29,708 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:29,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 179 transitions. [2024-09-12 17:50:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-09-12 17:50:29,708 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:29,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:29,709 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-09-12 17:50:29,709 INFO L399 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:29,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1579820480, now seen corresponding path program 1 times [2024-09-12 17:50:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892604229] [2024-09-12 17:50:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,743 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,745 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 17:50:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 17:50:29,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:29,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892604229] [2024-09-12 17:50:29,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892604229] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:29,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-12 17:50:29,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-12 17:50:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975446303] [2024-09-12 17:50:29,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:29,748 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-12 17:50:29,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:29,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-12 17:50:29,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:29,748 INFO L87 Difference]: Start difference. First operand 151 states and 179 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:29,793 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2024-09-12 17:50:29,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-12 17:50:29,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-09-12 17:50:29,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:29,794 INFO L225 Difference]: With dead ends: 157 [2024-09-12 17:50:29,795 INFO L226 Difference]: Without dead ends: 155 [2024-09-12 17:50:29,795 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-12 17:50:29,795 INFO L434 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:29,795 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-09-12 17:50:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-09-12 17:50:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 140 states have (on average 1.25) internal successors, (175), 147 states have internal predecessors, (175), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2024-09-12 17:50:29,814 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 33 [2024-09-12 17:50:29,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:29,814 INFO L474 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2024-09-12 17:50:29,815 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:29,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2024-09-12 17:50:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-09-12 17:50:29,815 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:29,815 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 17:50:29,816 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-09-12 17:50:29,816 INFO L399 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:29,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash 180412894, now seen corresponding path program 1 times [2024-09-12 17:50:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:29,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708437861] [2024-09-12 17:50:29,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:29,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,851 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,853 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 17:50:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 17:50:29,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:29,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708437861] [2024-09-12 17:50:29,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708437861] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:29,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559496191] [2024-09-12 17:50:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:29,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:29,857 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 17:50:29,858 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 17:50:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:29,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 17:50:29,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-12 17:50:29,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-12 17:50:29,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559496191] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-12 17:50:29,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-12 17:50:29,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-09-12 17:50:29,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702479651] [2024-09-12 17:50:29,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-12 17:50:29,922 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-12 17:50:29,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:29,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-12 17:50:29,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:50:29,923 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:29,999 INFO L93 Difference]: Finished difference Result 155 states and 184 transitions. [2024-09-12 17:50:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-12 17:50:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-09-12 17:50:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:30,001 INFO L225 Difference]: With dead ends: 155 [2024-09-12 17:50:30,002 INFO L226 Difference]: Without dead ends: 153 [2024-09-12 17:50:30,002 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-12 17:50:30,003 INFO L434 NwaCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:30,004 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 140 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-09-12 17:50:30,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-09-12 17:50:30,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 140 states have (on average 1.2357142857142858) internal successors, (173), 145 states have internal predecessors, (173), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 182 transitions. [2024-09-12 17:50:30,039 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 182 transitions. Word has length 36 [2024-09-12 17:50:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:30,039 INFO L474 AbstractCegarLoop]: Abstraction has 153 states and 182 transitions. [2024-09-12 17:50:30,039 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-09-12 17:50:30,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 182 transitions. [2024-09-12 17:50:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 17:50:30,041 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:30,041 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, 1, 1, 1, 1, 1] [2024-09-12 17:50:30,058 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 17:50:30,246 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-09-12 17:50:30,246 INFO L399 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:30,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1297832535, now seen corresponding path program 1 times [2024-09-12 17:50:30,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:30,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139388999] [2024-09-12 17:50:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:30,290 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:30,291 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-09-12 17:50:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:30,293 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 17:50:30,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:30,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139388999] [2024-09-12 17:50:30,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139388999] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:30,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271458394] [2024-09-12 17:50:30,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:30,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:30,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:30,295 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 17:50:30,296 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 17:50:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:30,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-09-12 17:50:30,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:30,361 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 17:50:30,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:30,390 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 17:50:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271458394] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:30,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-09-12 17:50:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095448695] [2024-09-12 17:50:30,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:30,391 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-12 17:50:30,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:30,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-12 17:50:30,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:50:30,392 INFO L87 Difference]: Start difference. First operand 153 states and 182 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:30,441 INFO L93 Difference]: Finished difference Result 158 states and 189 transitions. [2024-09-12 17:50:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-12 17:50:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2024-09-12 17:50:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:30,442 INFO L225 Difference]: With dead ends: 158 [2024-09-12 17:50:30,443 INFO L226 Difference]: Without dead ends: 157 [2024-09-12 17:50:30,443 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-09-12 17:50:30,443 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:30,443 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 102 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-12 17:50:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-09-12 17:50:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2024-09-12 17:50:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 144 states have internal predecessors, (172), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 181 transitions. [2024-09-12 17:50:30,463 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 181 transitions. Word has length 37 [2024-09-12 17:50:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:30,464 INFO L474 AbstractCegarLoop]: Abstraction has 152 states and 181 transitions. [2024-09-12 17:50:30,464 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:30,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 181 transitions. [2024-09-12 17:50:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-09-12 17:50:30,465 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:30,465 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 17:50:30,478 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 17:50:30,665 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-09-12 17:50:30,666 INFO L399 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:30,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash 650039683, now seen corresponding path program 1 times [2024-09-12 17:50:30,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:30,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427489914] [2024-09-12 17:50:30,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:30,820 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:30,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:30,824 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 17:50:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427489914] [2024-09-12 17:50:30,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427489914] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:30,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448841984] [2024-09-12 17:50:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:30,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:30,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:30,825 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 17:50:30,827 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 17:50:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:30,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-09-12 17:50:30,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:30,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-09-12 17:50:31,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:31,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2024-09-12 17:50:31,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:31,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2024-09-12 17:50:31,177 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 17:50:31,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:35,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2024-09-12 17:50:35,796 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-09-12 17:50:35,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 133 [2024-09-12 17:50:35,885 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 17:50:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448841984] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:35,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 14] total 31 [2024-09-12 17:50:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850235089] [2024-09-12 17:50:35,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:35,886 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-09-12 17:50:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:35,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-09-12 17:50:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=816, Unknown=0, NotChecked=0, Total=930 [2024-09-12 17:50:35,886 INFO L87 Difference]: Start difference. First operand 152 states and 181 transitions. Second operand has 31 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:40,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:50:45,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:50:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:46,310 INFO L93 Difference]: Finished difference Result 388 states and 459 transitions. [2024-09-12 17:50:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-09-12 17:50:46,310 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-09-12 17:50:46,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:46,311 INFO L225 Difference]: With dead ends: 388 [2024-09-12 17:50:46,311 INFO L226 Difference]: Without dead ends: 276 [2024-09-12 17:50:46,313 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=527, Invalid=3763, Unknown=0, NotChecked=0, Total=4290 [2024-09-12 17:50:46,313 INFO L434 NwaCegarLoop]: 41 mSDtfsCounter, 162 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:46,313 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 631 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 866 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-09-12 17:50:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-09-12 17:50:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 171. [2024-09-12 17:50:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.2327044025157232) internal successors, (196), 163 states have internal predecessors, (196), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 205 transitions. [2024-09-12 17:50:46,341 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 205 transitions. Word has length 37 [2024-09-12 17:50:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:46,342 INFO L474 AbstractCegarLoop]: Abstraction has 171 states and 205 transitions. [2024-09-12 17:50:46,342 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:46,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2024-09-12 17:50:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-09-12 17:50:46,342 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:46,343 INFO L216 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:46,355 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 17:50:46,546 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,12 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:46,547 INFO L399 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:46,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2094982991, now seen corresponding path program 3 times [2024-09-12 17:50:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757241426] [2024-09-12 17:50:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:46,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:46,903 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:50:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757241426] [2024-09-12 17:50:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757241426] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434457378] [2024-09-12 17:50:46,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 17:50:46,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:46,910 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 17:50:46,913 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 17:50:46,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-09-12 17:50:46,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:50:46,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 17:50:46,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-09-12 17:50:47,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-09-12 17:50:47,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434457378] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:47,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:47,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 4, 4] total 29 [2024-09-12 17:50:47,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753841742] [2024-09-12 17:50:47,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:47,200 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-09-12 17:50:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-09-12 17:50:47,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2024-09-12 17:50:47,201 INFO L87 Difference]: Start difference. First operand 171 states and 205 transitions. Second operand has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:47,700 INFO L93 Difference]: Finished difference Result 174 states and 210 transitions. [2024-09-12 17:50:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-09-12 17:50:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2024-09-12 17:50:47,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:47,701 INFO L225 Difference]: With dead ends: 174 [2024-09-12 17:50:47,701 INFO L226 Difference]: Without dead ends: 173 [2024-09-12 17:50:47,702 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=596, Invalid=2160, Unknown=0, NotChecked=0, Total=2756 [2024-09-12 17:50:47,702 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 180 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:47,702 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 351 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:47,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-09-12 17:50:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144. [2024-09-12 17:50:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 133 states have (on average 1.2105263157894737) internal successors, (161), 136 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 170 transitions. [2024-09-12 17:50:47,735 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 170 transitions. Word has length 39 [2024-09-12 17:50:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:47,735 INFO L474 AbstractCegarLoop]: Abstraction has 144 states and 170 transitions. [2024-09-12 17:50:47,738 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 states have internal predecessors, (52), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:47,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 170 transitions. [2024-09-12 17:50:47,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 17:50:47,739 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:47,739 INFO L216 NwaCegarLoop]: trace histogram [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] [2024-09-12 17:50:47,758 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-09-12 17:50:47,939 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-09-12 17:50:47,940 INFO L399 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:47,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash -49916565, now seen corresponding path program 1 times [2024-09-12 17:50:47,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:47,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924565937] [2024-09-12 17:50:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:48,116 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:48,118 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-09-12 17:50:48,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:48,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924565937] [2024-09-12 17:50:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924565937] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972079633] [2024-09-12 17:50:48,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:48,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:48,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:48,130 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 17:50:48,132 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 17:50:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:48,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-12 17:50:48,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:48,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-09-12 17:50:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972079633] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:48,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:48,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2024-09-12 17:50:48,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495120791] [2024-09-12 17:50:48,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:48,716 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 17:50:48,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 17:50:48,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-09-12 17:50:48,717 INFO L87 Difference]: Start difference. First operand 144 states and 170 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:49,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:49,007 INFO L93 Difference]: Finished difference Result 275 states and 328 transitions. [2024-09-12 17:50:49,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 17:50:49,007 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2024-09-12 17:50:49,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:49,008 INFO L225 Difference]: With dead ends: 275 [2024-09-12 17:50:49,008 INFO L226 Difference]: Without dead ends: 252 [2024-09-12 17:50:49,009 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-09-12 17:50:49,009 INFO L434 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:49,009 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 372 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:50:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-09-12 17:50:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2024-09-12 17:50:49,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 239 states have (on average 1.209205020920502) internal successors, (289), 243 states have internal predecessors, (289), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 299 transitions. [2024-09-12 17:50:49,079 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 299 transitions. Word has length 44 [2024-09-12 17:50:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:49,080 INFO L474 AbstractCegarLoop]: Abstraction has 251 states and 299 transitions. [2024-09-12 17:50:49,080 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 19 states have internal predecessors, (55), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-09-12 17:50:49,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 299 transitions. [2024-09-12 17:50:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-09-12 17:50:49,081 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:49,081 INFO L216 NwaCegarLoop]: trace histogram [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, 1] [2024-09-12 17:50:49,093 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 17:50:49,284 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-09-12 17:50:49,285 INFO L399 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:49,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:49,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1875833903, now seen corresponding path program 1 times [2024-09-12 17:50:49,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:49,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822719330] [2024-09-12 17:50:49,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:49,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:49,356 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:49,358 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 17:50:49,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822719330] [2024-09-12 17:50:49,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822719330] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:49,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126778028] [2024-09-12 17:50:49,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:49,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:49,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:49,360 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 17:50:49,366 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 17:50:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:49,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-09-12 17:50:49,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 17:50:49,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 17:50:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126778028] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:49,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-09-12 17:50:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555271660] [2024-09-12 17:50:49,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:49,513 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-09-12 17:50:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-09-12 17:50:49,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-09-12 17:50:49,515 INFO L87 Difference]: Start difference. First operand 251 states and 299 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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 17:50:49,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:49,787 INFO L93 Difference]: Finished difference Result 532 states and 634 transitions. [2024-09-12 17:50:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-09-12 17:50:49,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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 43 [2024-09-12 17:50:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:49,788 INFO L225 Difference]: With dead ends: 532 [2024-09-12 17:50:49,789 INFO L226 Difference]: Without dead ends: 375 [2024-09-12 17:50:49,789 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-09-12 17:50:49,790 INFO L434 NwaCegarLoop]: 30 mSDtfsCounter, 89 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:49,790 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 142 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-09-12 17:50:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 303. [2024-09-12 17:50:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 291 states have (on average 1.1580756013745706) internal successors, (337), 295 states have internal predecessors, (337), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 347 transitions. [2024-09-12 17:50:49,875 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 347 transitions. Word has length 43 [2024-09-12 17:50:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:49,875 INFO L474 AbstractCegarLoop]: Abstraction has 303 states and 347 transitions. [2024-09-12 17:50:49,876 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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 17:50:49,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 347 transitions. [2024-09-12 17:50:49,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-09-12 17:50:49,877 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:49,877 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:49,889 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 17:50:50,077 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-09-12 17:50:50,079 INFO L399 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:50,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:50,079 INFO L85 PathProgramCache]: Analyzing trace with hash -3310312, now seen corresponding path program 1 times [2024-09-12 17:50:50,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792320189] [2024-09-12 17:50:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:50,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:50,155 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:50,157 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 17:50:50,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792320189] [2024-09-12 17:50:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792320189] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763159163] [2024-09-12 17:50:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:50,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:50,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:50,159 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 17:50:50,161 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 17:50:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:50,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-12 17:50:50,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 17:50:50,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-09-12 17:50:50,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763159163] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:50,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:50,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-09-12 17:50:50,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658831228] [2024-09-12 17:50:50,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:50,320 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-09-12 17:50:50,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:50,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-09-12 17:50:50,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-09-12 17:50:50,321 INFO L87 Difference]: Start difference. First operand 303 states and 347 transitions. Second operand has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:50,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:50,630 INFO L93 Difference]: Finished difference Result 720 states and 859 transitions. [2024-09-12 17:50:50,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-09-12 17:50:50,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2024-09-12 17:50:50,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:50,633 INFO L225 Difference]: With dead ends: 720 [2024-09-12 17:50:50,633 INFO L226 Difference]: Without dead ends: 719 [2024-09-12 17:50:50,633 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-09-12 17:50:50,634 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 60 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:50,634 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 236 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-09-12 17:50:50,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2024-09-12 17:50:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 707 states have (on average 1.166902404526167) internal successors, (825), 711 states have internal predecessors, (825), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 835 transitions. [2024-09-12 17:50:50,950 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 835 transitions. Word has length 44 [2024-09-12 17:50:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:50,950 INFO L474 AbstractCegarLoop]: Abstraction has 719 states and 835 transitions. [2024-09-12 17:50:50,950 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.333333333333333) internal successors, (80), 16 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:50:50,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:50,954 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 835 transitions. [2024-09-12 17:50:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-09-12 17:50:50,955 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:50,955 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:50,967 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-09-12 17:50:51,155 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-09-12 17:50:51,155 INFO L399 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:51,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash 704517007, now seen corresponding path program 2 times [2024-09-12 17:50:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146506616] [2024-09-12 17:50:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:51,355 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:51,357 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-09-12 17:50:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 17:50:51,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:51,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146506616] [2024-09-12 17:50:51,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146506616] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:51,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961477602] [2024-09-12 17:50:51,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:50:51,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:51,361 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 17:50:51,364 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 17:50:51,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 17:50:51,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:50:51,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-12 17:50:51,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-09-12 17:50:51,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:51,676 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-12 17:50:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961477602] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:51,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:51,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2024-09-12 17:50:51,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631001619] [2024-09-12 17:50:51,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:51,678 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-09-12 17:50:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:51,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-09-12 17:50:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2024-09-12 17:50:51,679 INFO L87 Difference]: Start difference. First operand 719 states and 835 transitions. Second operand has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 17:50:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:52,332 INFO L93 Difference]: Finished difference Result 749 states and 865 transitions. [2024-09-12 17:50:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-09-12 17:50:52,333 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2024-09-12 17:50:52,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:52,336 INFO L225 Difference]: With dead ends: 749 [2024-09-12 17:50:52,337 INFO L226 Difference]: Without dead ends: 723 [2024-09-12 17:50:52,337 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-09-12 17:50:52,337 INFO L434 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:52,338 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 627 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-09-12 17:50:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2024-09-12 17:50:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 719. [2024-09-12 17:50:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 707 states have (on average 1.164073550212164) internal successors, (823), 711 states have internal predecessors, (823), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 833 transitions. [2024-09-12 17:50:52,604 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 833 transitions. Word has length 47 [2024-09-12 17:50:52,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:52,604 INFO L474 AbstractCegarLoop]: Abstraction has 719 states and 833 transitions. [2024-09-12 17:50:52,604 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.15) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-12 17:50:52,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 833 transitions. [2024-09-12 17:50:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-12 17:50:52,605 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:52,606 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:52,622 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 17:50:52,809 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,17 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:52,810 INFO L399 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:52,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1699138700, now seen corresponding path program 2 times [2024-09-12 17:50:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695909205] [2024-09-12 17:50:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:52,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:52,998 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:50:53,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:53,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695909205] [2024-09-12 17:50:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695909205] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:53,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086874383] [2024-09-12 17:50:53,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-12 17:50:53,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:53,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:53,002 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 17:50:53,003 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 17:50:53,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-12 17:50:53,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:50:53,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-09-12 17:50:53,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:50:53,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:50:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:50:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086874383] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:50:53,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:50:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 19 [2024-09-12 17:50:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887776594] [2024-09-12 17:50:53,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:50:53,322 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-09-12 17:50:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:50:53,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-09-12 17:50:53,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-09-12 17:50:53,323 INFO L87 Difference]: Start difference. First operand 719 states and 833 transitions. Second operand has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 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 17:50:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:50:53,605 INFO L93 Difference]: Finished difference Result 726 states and 838 transitions. [2024-09-12 17:50:53,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-09-12 17:50:53,605 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 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 50 [2024-09-12 17:50:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:50:53,611 INFO L225 Difference]: With dead ends: 726 [2024-09-12 17:50:53,611 INFO L226 Difference]: Without dead ends: 381 [2024-09-12 17:50:53,612 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-09-12 17:50:53,616 INFO L434 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-12 17:50:53,619 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 377 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-12 17:50:53,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-09-12 17:50:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-09-12 17:50:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 370 states have (on average 1.172972972972973) internal successors, (434), 373 states have internal predecessors, (434), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:50:53,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 443 transitions. [2024-09-12 17:50:53,772 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 443 transitions. Word has length 50 [2024-09-12 17:50:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:50:53,772 INFO L474 AbstractCegarLoop]: Abstraction has 381 states and 443 transitions. [2024-09-12 17:50:53,772 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.789473684210526) internal successors, (72), 19 states have internal predecessors, (72), 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 17:50:53,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 443 transitions. [2024-09-12 17:50:53,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-09-12 17:50:53,773 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:50:53,773 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-12 17:50:53,785 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 17:50:53,975 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-09-12 17:50:53,976 INFO L399 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:50:53,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:50:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1120585368, now seen corresponding path program 3 times [2024-09-12 17:50:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:50:53,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305842707] [2024-09-12 17:50:53,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:50:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:50:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:54,768 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:50:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:50:54,770 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-09-12 17:50:54,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:50:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305842707] [2024-09-12 17:50:54,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305842707] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:50:54,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255882463] [2024-09-12 17:50:54,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 17:50:54,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:50:54,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:50:54,772 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 17:50:54,774 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 17:50:54,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-09-12 17:50:54,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:50:54,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-09-12 17:50:54,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:50:54,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-09-12 17:50:55,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:55,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2024-09-12 17:50:55,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:55,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 20 [2024-09-12 17:50:55,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:50:55,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-09-12 17:50:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 17:50:55,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:51:04,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2024-09-12 17:51:04,035 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-09-12 17:51:04,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2565 treesize of output 2199 [2024-09-12 17:51:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 1 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 17:51:12,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255882463] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:51:12,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:51:12,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 46 [2024-09-12 17:51:12,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051902238] [2024-09-12 17:51:12,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:51:12,367 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-09-12 17:51:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:51:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-09-12 17:51:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1820, Unknown=4, NotChecked=0, Total=2070 [2024-09-12 17:51:12,368 INFO L87 Difference]: Start difference. First operand 381 states and 443 transitions. Second operand has 46 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 44 states have internal predecessors, (101), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:51:19,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:23,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:27,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:31,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:35,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:39,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:44,686 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_main_~#v~0.offset| 4)) (.cse0 (select |c_#memory_int#1| |c_main_~#v~0.base|))) (and (or (forall ((v_ArrVal_389 Int)) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select (store .cse0 (+ |c_main_~#v~0.offset| (* c_main_~j~0 4)) v_ArrVal_389) .cse1) 1))) (< c_main_~j~0 1)) (<= (+ (select .cse0 0) 1) (select .cse0 4)) (forall ((v_ArrVal_389 Int)) (let ((.cse2 (store .cse0 (+ (* c_main_~i~0 4) |c_main_~#v~0.offset| 4) v_ArrVal_389))) (< (select .cse2 |c_main_~#v~0.offset|) (+ (select .cse2 .cse1) 1)))) (= |c_main_~#v~0.offset| 0))) is different from false [2024-09-12 17:51:49,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:53,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:51:57,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:01,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:05,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:10,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:14,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:18,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:22,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:43,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:47,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:51,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:55,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:52:59,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:03,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:07,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:11,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:15,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:31,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:35,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:39,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:44,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:48,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:53:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-12 17:53:48,464 INFO L93 Difference]: Finished difference Result 988 states and 1156 transitions. [2024-09-12 17:53:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-09-12 17:53:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 44 states have internal predecessors, (101), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2024-09-12 17:53:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-12 17:53:48,467 INFO L225 Difference]: With dead ends: 988 [2024-09-12 17:53:48,467 INFO L226 Difference]: Without dead ends: 681 [2024-09-12 17:53:48,469 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 52.0s TimeCoverageRelationStatistics Valid=755, Invalid=6211, Unknown=10, NotChecked=164, Total=7140 [2024-09-12 17:53:48,469 INFO L434 NwaCegarLoop]: 35 mSDtfsCounter, 229 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 41 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 120.9s IncrementalHoareTripleChecker+Time [2024-09-12 17:53:48,469 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 919 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1598 Invalid, 29 Unknown, 89 Unchecked, 120.9s Time] [2024-09-12 17:53:48,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-09-12 17:53:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 399. [2024-09-12 17:53:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 388 states have (on average 1.1597938144329898) internal successors, (450), 391 states have internal predecessors, (450), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:53:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 459 transitions. [2024-09-12 17:53:48,605 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 459 transitions. Word has length 53 [2024-09-12 17:53:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-12 17:53:48,605 INFO L474 AbstractCegarLoop]: Abstraction has 399 states and 459 transitions. [2024-09-12 17:53:48,605 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 2.2954545454545454) internal successors, (101), 44 states have internal predecessors, (101), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-09-12 17:53:48,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 459 transitions. [2024-09-12 17:53:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-09-12 17:53:48,606 INFO L208 NwaCegarLoop]: Found error trace [2024-09-12 17:53:48,606 INFO L216 NwaCegarLoop]: trace histogram [3, 3, 3, 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 17:53:48,619 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-09-12 17:53:48,810 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:48,811 INFO L399 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-09-12 17:53:48,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-12 17:53:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 906065306, now seen corresponding path program 3 times [2024-09-12 17:53:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-12 17:53:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789858974] [2024-09-12 17:53:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-12 17:53:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-12 17:53:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:49,789 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-12 17:53:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:49,790 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-09-12 17:53:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-12 17:53:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-12 17:53:49,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-12 17:53:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789858974] [2024-09-12 17:53:49,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789858974] provided 0 perfect and 1 imperfect interpolant sequences [2024-09-12 17:53:49,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624283411] [2024-09-12 17:53:49,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-09-12 17:53:49,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-12 17:53:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-12 17:53:49,798 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 17:53:49,802 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 17:53:49,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-09-12 17:53:49,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-12 17:53:49,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-09-12 17:53:49,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-12 17:53:50,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-09-12 17:53:51,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-09-12 17:53:51,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-09-12 17:53:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 17:53:51,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-12 17:53:52,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-09-12 17:53:52,223 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-09-12 17:53:52,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2024-09-12 17:53:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-09-12 17:53:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624283411] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-12 17:53:56,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-09-12 17:53:56,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 19] total 50 [2024-09-12 17:53:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082487521] [2024-09-12 17:53:56,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-09-12 17:53:56,740 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-09-12 17:53:56,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-12 17:53:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-09-12 17:53:56,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2180, Unknown=1, NotChecked=0, Total=2450 [2024-09-12 17:53:56,741 INFO L87 Difference]: Start difference. First operand 399 states and 459 transitions. Second operand has 50 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 48 states have internal predecessors, (125), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-12 17:54:00,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:04,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:09,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:13,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:17,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:21,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:25,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:30,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:54:34,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:54:38,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:54:42,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:54:46,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:54:50,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-09-12 17:54:54,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-09-12 17:54:58,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]